TomerEven / Prefix-FilterLinks
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
Sorting:
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆45Updated last month
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆35Updated 5 months ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆45Updated 10 months ago
- ☆38Updated 5 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- ☆54Updated last year
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated last year
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆31Updated 3 months ago
- Succinct C++☆24Updated 4 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 3 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆86Updated 4 years ago
- Additional C++11 Random Distributions☆19Updated last year
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- Learned Monotone Minimal Perfect Hashing☆27Updated 4 months ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆127Updated last year
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆37Updated 2 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Updated 2 years ago
- HOT - Height Optimized Trie☆156Updated 7 years ago
- std::map/std::set implementation using the adaptive radix tree☆15Updated 4 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Fast Approximate Membership Filters (C++)☆280Updated 7 months ago
- Self-Tuning Adaptive Radix Tree☆27Updated 5 years ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆49Updated 5 years ago
- ☆12Updated 6 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆155Updated last year
- Bloom-filter based minimal perfect hash function library☆266Updated 2 weeks ago
- Dynamic succinct/compressed data structures☆112Updated last year