Search Results for "b plus tree java"

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.

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

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.

An extensible spatial index library in C++ that supports robust spatial indexing methods and many advanced features. Currently supports R-tree (Rtree, R*-tree) variants, Multi Version R-trees (MVR-tree) and TPR-trees. For more information please visit the project homepage.

Cross platform indexed file btree implementation in C#, java and Python: Commit/abort transactions, localized unicode string order, recovery of damaged files, and configurable memory footprint, hashing, prefixing, and object serialization.

The most powerful non-commercial translation memory software (TM tool) with enhanced capabilities, like networking/collaboration (http, rpc), encoding conversion, project management capabilities, email capability with attachments, file tree diff etc.