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 10 months ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆42Updated 2 weeks ago
- ☆38Updated 4 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 3 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 6 months ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated last year
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- Succinct C++☆25Updated 4 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆85Updated 4 years ago
- ☆50Updated 3 months ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆33Updated last month
- std::map/std::set implementation using the adaptive radix tree☆13Updated 3 years ago
- Additional C++11 Random Distributions☆17Updated 9 months ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 3 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆130Updated 3 years ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆35Updated 2 years ago
- Implementation of Origami: A High-Performance Mergesort Framework☆27Updated 4 months ago
- A fast approximate membership query data structure☆11Updated 8 months ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆29Updated 4 months ago
- HOT - Height Optimized Trie☆146Updated 6 years ago
- Self-Tuning Adaptive Radix Tree☆27Updated 4 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- Order-preserving key encoder☆122Updated 4 years ago
- ☆10Updated 3 years ago
- Learned Monotone Minimal Perfect Hashing☆25Updated 3 months ago
- simd enabled column imprints☆11Updated 7 years ago
- Paper about the estimation of cardinalities from HyperLogLog sketches☆62Updated 3 years ago
- ☆12Updated 6 years ago