fusiyuan2010 / cuttdb
a hash-based key-value database for persistent storing massive small records
☆40Updated 10 years ago
Alternatives and similar repositories for cuttdb:
Users that are interested in cuttdb are comparing it to the libraries listed below
- High-performance nosql database. Written in C, multi-threaded, based on LightningDB and nanomsg.☆116Updated 11 years ago
- Roaring bitmaps in C☆17Updated 8 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 10 years ago
- Feed-forward Bloom filters☆52Updated 13 years ago
- MDBM a very fast memory-mapped key/value store.☆77Updated last year
- Redis is an in-memory database that persists on disk. The data model is key-value, but many different kind of values are supported: Strin…☆129Updated 10 years ago
- Library implementing the storage and the query evaluation for a text search engine. It uses on a key value store database interface to st…☆47Updated 3 years ago
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆41Updated 8 years ago
- Eblob is an append-only low-level IO library, which saves data in blob files. Created as low-level backend for elliptics☆104Updated 5 years ago
- ☆25Updated 7 years ago
- Batch Monitor - Gain performance by combining work from multiple threads into a single batch☆30Updated 9 years ago
- Wannabe Main Memory Database and More☆53Updated 4 years ago
- Embedded storage benchmarking tool☆137Updated 2 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 4 years ago
- A system for maintaining replicated state machines☆114Updated 7 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆115Updated 8 years ago
- A column oriented, embarrassingly distributed relational event database.☆240Updated 6 years ago
- Vanilla JavaScript interpreter with built-in NO-SQL document database with Btree & ARTful indexing from the database project.☆13Updated 4 years ago
- C++ utility library☆24Updated 11 years ago
- A queue implemented on an array, written in C using the BSD licence.☆11Updated 9 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆49Updated 10 months ago
- lock free modified prefix B+tree append-only database☆115Updated 9 years ago
- Static Radix Tree (Patricia trie) implementation in C☆47Updated 7 years ago
- Algorithms to compress sorted arrays of integers☆18Updated 10 years ago
- A light weight, low level embedded key-value database library☆32Updated 11 years ago
- Take 1 TCP listen socket and duplicate it across N threads so you get some sweet multi-thread action happening☆24Updated 4 years ago
- Implementation of Alexander A. Stepanov inverted Index Compression algorithms☆21Updated 9 years ago
- Fast and Reliable (but not Secure) Hash☆53Updated 6 years ago
- generate perfect hashes (alpha)☆77Updated 2 years ago
- Proof of concept LSM-tree built on MDB☆17Updated 9 years ago