efficient / ffbfLinks
Feed-forward Bloom filters
☆52Updated 14 years ago
Alternatives and similar repositories for ffbf
Users that are interested in ffbf are comparing it to the libraries listed below
Sorting:
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- Iterator library.☆79Updated 5 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Lock-free multithreaded memory allocation☆106Updated 8 years ago
- ☆26Updated 8 years ago
- A system for maintaining replicated state machines☆115Updated 8 years ago
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- Fast decoder for VByte-compressed integers☆124Updated last year
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆42Updated 8 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 11 years ago
- bit & sketches data structures☆60Updated 6 years ago
- Consistent Hashing data structures and algorithms for C++☆39Updated 8 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 5 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 5 years ago
- High-performance dictionary coding☆104Updated 8 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆50Updated last year
- RWMutex for sharing of multicore machines.☆17Updated 6 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 3 years ago
- ☆24Updated 10 years ago
- Implementation of Alexander A. Stepanov inverted Index Compression algorithms☆21Updated 9 years ago
- A Distributed Key-Value Store for FAWN☆77Updated 14 years ago
- Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…☆53Updated 12 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- a quotient filter written in C☆86Updated 7 years ago
- Paxos-replicated key-value store in 3 hours or less.☆25Updated 8 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- Wannabe Main Memory Database and More☆53Updated 4 years ago
- Compute xxHash hash codes for 8 keys in parallel☆46Updated 6 years ago
- finding set bits in large bitmaps☆15Updated 9 years ago
- Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs☆10Updated 9 years ago