TomerEven / Prefix-Filter
Prefix Filter: Practically and Theoretically Better Than Bloom.
☆48Updated 2 years ago
Alternatives and similar repositories for Prefix-Filter:
Users that are interested in Prefix-Filter are comparing it to the libraries listed below
- ☆53Updated 11 months ago
- Succinct C++☆24Updated 4 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆44Updated last month
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 8 months ago
- ☆38Updated 4 years ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆35Updated 2 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆33Updated 2 months ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated last year
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 3 years ago
- A fast approximate membership query data structure☆11Updated 9 months ago
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 3 years ago
- HOT - Height Optimized Trie☆149Updated 7 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- ☆51Updated 5 months ago
- Adaptive Radix Tree in C++☆44Updated 2 weeks ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆99Updated 2 years ago
- Additional C++11 Random Distributions☆17Updated 11 months ago
- Self-Tuning Adaptive Radix Tree☆27Updated 5 years ago
- ☆12Updated 3 years ago
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆57Updated 2 weeks ago
- A read-optimized learned index for unsorted data☆31Updated last year
- ☆12Updated 6 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆86Updated 4 years ago
- ☆45Updated last year
- The world's first wait-free KV store with generic durable linearizable transactions☆40Updated 3 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- An open-source BzTree implementation☆92Updated 3 years ago
- Order-preserving key encoder☆122Updated 5 years ago