btrask / lsmdbLinks
Proof of concept LSM-tree built on MDB
☆17Updated 10 years ago
Alternatives and similar repositories for lsmdb
Users that are interested in lsmdb are comparing it to the libraries listed below
Sorting:
- NetBSD cdb (constant database) library☆14Updated 6 years ago
- Batch Monitor - Gain performance by combining work from multiple threads into a single batch☆30Updated 10 years ago
- bit & sketches data structures☆60Updated 6 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- Trlmdb is a replicating database using time stamps.☆14Updated 9 years ago
- Feed-forward Bloom filters☆52Updated 14 years ago
- nkvdb - is a numeric time-series database.☆35Updated 8 years ago
- qp tries and crit-bit tries☆121Updated 3 years ago
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- Lock-free multithreaded memory allocation☆108Updated 8 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 11 years ago
- Simple out-of-process invoker☆18Updated 2 months ago
- High-performance dictionary coding☆104Updated 8 years ago
- C based ordered key-value ACID DB using a skip list data structure☆163Updated 10 years ago
- fast SIMD-able JIT regular expression compiler☆197Updated 10 years ago
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 14 years ago
- Concurrent trie-hash map library☆92Updated last year
- lock free modified prefix B+tree append-only database☆117Updated 10 years ago
- A library for Rapid {C|Concurrency|Correct} Development☆34Updated 9 years ago
- C library/compiler for the Cap'n Proto serialization/RPC protocol☆69Updated 2 years ago
- An obsolete project☆83Updated 7 years ago
- Benchmark showing the we can randomly hash strings very quickly with good universality☆137Updated 7 months ago
- Durable dead simple queue that allows zero copy semantics. Durable under failure!☆18Updated 9 years ago
- Rolla - Tiny, fast, crash-safe embedded k/v storage engine☆53Updated 2 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- generate perfect hashes (alpha)☆77Updated 3 years ago
- A threaded, continuations-based I/O event library for manycore NUMA machines☆73Updated 4 years ago
- Thread safe and multi-endian version of Bob Jenkins' spookyhash☆69Updated 4 years ago
- Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations☆37Updated 6 years ago
- A system for maintaining replicated state machines☆115Updated 8 years ago