Search Results for "tree database"

libadb is an astronomical catalog management library desgined to provide fast access to astronomical object data.

Very simple struct storage system, AVL and red-black tree based database library - database engine. You can define indexes over C struct.

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.

meta-treedb can implement malloc functionality, and much more! Need a heap that allocates from a fixed size chunk of memory? No problem. But where treedb comes into its own is when it comes to allocating from a mmap()ed disk file - the memory becomes persistent. 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...

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!

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.

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).

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.

RedBlack balance tree searching and sorting library