efficient / ffbf
Feed-forward Bloom filters
☆52Updated 13 years ago
Alternatives and similar repositories for ffbf:
Users that are interested in ffbf are comparing it to the libraries listed below
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- Lock-free multithreaded memory allocation☆106Updated 8 years ago
- Implementation of Alexander A. Stepanov inverted Index Compression algorithms☆21Updated 9 years ago
- ☆27Updated 8 years ago
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆42Updated 8 years ago
- RLU resizable hash-table☆17Updated 9 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
- A system for maintaining replicated state machines☆114Updated 8 years ago
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 13 years ago
- RWMutex for sharing of multicore machines.☆17Updated 5 years ago
- Userspace file-system using the TokuFT fractal tree library☆23Updated 3 years ago
- Roaring bitmaps in C☆17Updated 9 years ago
- bit & sketches data structures☆60Updated 6 years ago
- Iterator library.☆79Updated 5 years ago
- ☆24Updated 10 years ago
- A distributed key-value cache with builtin materialized views.☆26Updated 10 years ago
- Paxos-replicated key-value store in 3 hours or less.☆25Updated 8 years ago
- Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs☆10Updated 9 years ago
- Wren: Nonblocking Reads in a Partitioned Transactional Causally Consistent Data Store☆8Updated 6 years ago
- finding set bits in large bitmaps☆15Updated 9 years ago
- Artifact for PPoPP'18☆19Updated 3 years ago
- ☆26Updated 8 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- Proof of concept LSM-tree built on MDB☆17Updated 9 years ago
- A Distributed Key-Value Store for FAWN☆76Updated 14 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 10 years ago
- Userspace TCP/IP stack☆68Updated 11 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- Dependably fast multi-core in-memory transactions☆20Updated 7 years ago