Search Results for "b-tree"
Sort By:
Showing 26 open source projects for "b-tree"
View related business solutions-
Try Google Cloud Risk-Free With $300 in CreditUse your credit across every product. Compute, storage, AI, analytics. When it runs out, 20+ products stay free. You only pay when you choose to.
-
Gemini 3 and 200+ AI Models on One PlatformBuild, govern, and optimize agents and models with Gemini Enterprise Agent Platform.
-
1
db4o-gpl
new db4o gpl source code, for java7+ .netstandard2 android xamarin
Object-Oriented Database the best database project to help you to learn how to make databases https://sourceforge.net/p/db4o-gpl/code/ci/master/tree/README.md -
2
libadb
Astronomical Database
libadb is an astronomical catalog management library desgined to provide fast access to astronomical object data. -
3
nonblonde
A Key/data Store
Nonblonde is a key/value database. Nonblonde tables are backed by b-trees that organize their nodes as critical bit trees. It allows multiple tables per store, atomic updates, keys of unlimited size. Head and tail key compression and a variable block size reduce the database disk size. Disk blocks are never modified in place, for which the written database is always in an intended state and does not need repair or recovery. -
4
JQuickBase
elementary database files for Java, B+ tree index files, ISAM
Java API to realize quick ISAM (Index Sequential Access Method) functionality for application in the file system. Includes scalable database files w/ space recovery and variable record length, scalable B+Tree index files. Supports file backup and restore. Two package types: one with and one without strong file encryption using Twofish algorithm and state-of-the-art encryption technology. -
Add Two Lines of Code. Get Full APM.Works out of the box for Rails, Django, Express, Phoenix, and more. Monitoring exceptions and performance in no time.
-
5
avldb
Simple struct storage system, database library and engine.
Very simple struct storage system, AVL and red-black tree based database library - database engine. You can define indexes over C struct. -
6
levin
in-memory key value server with fuzzy search capabilities
Levin is an event-based key/value server based on radix-tree (space optimized trie). Key search can be performed with an approximate key matching algorithm based on Levenshtein edit distance. -
7
meta-treedb
on-disk memory library using meta-data
...If you follow the tests/examples, you too can store dictionaries, trees, lists or whatever you can think of in disk-based memory, just an open() and mmap() away. Meta-treedb comes with an AVL tree, doubly-linked-list and variable-entry-sized-array implementations for you to use in your data structures. So, what distinguishes meta-treedb from treedb? * "class" interfaces for treedb collections These are vtables (virtual function tables) that implement the interface. * faster compiles - only the "class" interfaces are visible to client code This is at the expense of a small performance hit... -
8
lmdb++
C++11 wrapper for the LMDB embedded B+ tree database library.
This is a comprehensive C++ wrapper for the LMDB embedded database library, offering both an error-checked procedural interface and an object-oriented resource interface with RAII semantics. • Designed to be entirely self-contained as a single <lmdb++.h> header file that can be dropped into a project. • Implements a straightforward mapping from C to C++, with consistent naming. • Provides both a procedural interface and an object-oriented RAII interface. • Simplifies error handling by... -
9
DB Comparator is a simple to use tool to compare and sync MS SQL Server databases. It shows all data object differences side by side in a hierarchical tree view. It compares tables, views, indexes, constraints, procedures, functions and user data typ
-
Full-stack observability with actually useful AI | Grafana CloudBuilt on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
-
10
Occursions
Fast customizable time series web database for big data like log files
Our goal is to create the world's fastest extendable, non-transactional time series database for big data (you know, for kids)! Log file indexing is our initial focus. For example append only ASCII files produced by libraries like Log4J, or containing FIX messages or JSON objects. Occursions was built by a small team sick of creating hacks to remotely copy and/or grep through tons of large log files. We use it to index around a terabyte of new log data per day. You can use it too. Who... -
11
solidDB for MySQL
SolidDB Storage Engine for MySQL
solidDB for MySQL is an open source relational database management system (RDBMS) that consists of MySQL Server and solidDB Storage Engine for MySQL. Project has morphed into a fully pluggable storage engine for MySQL 5.5 and later. Follow us on Facebook via the SolidDB MySQL Storage Engine page! -
12
Binary tree as a PostgreSQL data type. This was a university class project and I don't intend to develop it further. Made in Visual Studio 2010 for PostgreSQL 9.0. DLL provided (debug build). May you find the code useful.
-
13
An append only database manager in the style of dbm. It has both a C and a Python interface and is ACID compliant. Internally it uses an immutable B+ Tree. (Being append only doesn't mean that you can't replace records or delete keys).
-
14
iMeMex is a dataspace management system. iMeMex is a research prototype. The package also provides several useful components for research such as external sorting, B+-trees, inverted indexes, content converters, query operators, and graph indexes.
-
15
Tokyo Cabinet is the successor of QDBM, a high performance database library similar to the DBM family. It also supports hash and B-tree databases and does not require any server process. The overall speed is improved compared to QDBM.
-
16
HeliDB is a database for persisting key—value pairs from Java programs. Users have many choices in configuring what features they want the database to have and in how the data is stored. Features are for instance transactions and fast B+ trees.
-
17
A Tree is a hierarchical object database, based on Offsider technology. Data and/or functionality is stored as properties of nodes on the database. The Tree and all its nodes understand about paths. Database and nodes respond to object messages.
-
18
A disk based production quality RTree based upon Guttmans quadratic split algorithm having following features: Buffering with dirty write, Index joins, Tree Seeding, Window and NN queries, Runtime STR Packing capability, Completely Thread safe.
-
19
ChaiDB is an embedded data storage developed at the kernel level by using B-Tree implementation. It is a natural database choice for name/value applications such as JSON. JSON-Cache utilizes ChaiDB to provide persistence and cache solution for JSON data.
-
20
Utility for scheduling a SQL Backup from server A, compressing them, copying into server B on sepecified time, running on Client/Server C.
-
21
XSpace is a globally accessible repository for hierarchically-keyed information. It provides persistence for trees with an elegant tree-navigation API. XSpace also publishes real-time events whenever a persisted tree is updated.
-
22
Red/Black Tree implementation. Port of the sourceforge libredblack library to C#. The package also consists of mutlitree (tree with non-unique key) and tree with quick direct access to items by the index.
-
23
Persitancy api simaler to Prevailer but with more transparancy and less intrusiv to how you can disign your data structure. It uses a bytecode enhancer to add needed code to have your object presited betwhen sessions.
-
24
JSpeed -- Java-based Open-Source Embedded Database Management System supporting network database model with limited relational access. JSpeed's goal is to provide a high-speed embedded database written in 100 percent Java. Key management uses EP-Tree.
-
25
