Search Results for "b tree"

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.

...Zstd compression (use the compression build feature, disabled by default). Cpu-scalable lock-free implementation. Flash-optimized log-structured storage. Uses modern b-tree techniques such as prefix encoding and suffix truncation for reducing the storage costs of long keys with shared prefixes. If keys are the same length and sequential then the system can avoid storing 99%+ of the key data in most cases, essentially acting like a learned index. sled performs prefix encoding on long keys with similar prefixes that are grouped together in a range, as well as suffix truncation to further reduce the indexing costs of long keys.

Hitchhiker-Tree is a functional, immutable, off-heap, snapshottable sorted map data structure (a persistent key-value tree) designed for scalable, high-performance storage in Clojure / ClojureScript systems. It blends ideas from fractal trees and B-trees, supports lazy loading, and can persist incrementally to arbitrary backends. It is used as a backend for systems like Datahike and can support enormous data sets while retaining functional persistence semantics. ...

...Go must be installed on the build machine. It may be worth noting that while SummitDB supports many Redis features, it is not a strict Redis clone. SummitDB provides one key space that is a large B-tree. An ordered key space allows for stable paging through keys using the KEYS command. Redis uses an unordered dictionary structure and provides a specialized SCAN command for iterating through keys.

lib_data_io is a set of PHP libraries designed to easily move complex sets of data between PHP array data structures and a variety of sources and destinations including JSON, XML, ICAL, MySQL, HTML, Trac WIKI, text, LDIF, and plot images.

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

B-Tree implemented in Common Lisp. Stores key/value pairs onto disk based data structure. Current implementation has been tested with SBCL. Project was originally at alien-consader.org but is now made available at SourceForge.

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.

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.