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:
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 14 years ago
- Feed-forward Bloom filters☆53Updated 14 years ago
- 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
- Trlmdb is a replicating database using time stamps.☆14Updated 9 years ago
- Fast differential coding functions (using SIMD instructions)☆55Updated 7 years ago
- qp tries and crit-bit tries☆122Updated 3 years ago
- Lock-free slab allocator / freelist.☆69Updated 10 years ago
- lock free modified prefix B+tree append-only database☆116Updated 10 years ago
- Concurrent trie-hash map library☆92Updated last year
- ☆27Updated 8 years ago
- bit & sketches data structures☆60Updated 6 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- Lock-free multithreaded memory allocation☆108Updated 8 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 11 years ago
- nkvdb - is a numeric time-series database.☆35Updated 8 years ago
- C based ordered key-value ACID DB using a skip list data structure☆163Updated 10 years ago
- Fast decoder for VByte-compressed integers☆125Updated last year
- malloc leak tracer☆71Updated 3 years ago
- A system for maintaining replicated state machines☆116Updated 8 years ago
- Bloom filter alternative (C++)☆18Updated 6 years ago
- Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations☆38Updated 6 years ago
- Backtrace.io's resilient log record framing format☆40Updated 3 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- Benchmarks for Schemaless Data Serialization Libraries☆56Updated 3 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- High-performance dictionary coding☆108Updated 8 years ago
- Fast Hash Functions Using AES Intrinsics☆83Updated 6 years ago
- Netstring parsing in C☆36Updated 5 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago