Search Results for "tree database"

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.

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

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

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!

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

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.

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.

A disk based production quality RTree based upon Guttman’s 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.

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.

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.

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.

RedBlack balance tree searching and sorting library