pdillinger / fastfilter_cppLinks
Fast Approximate Membership Filters (C++)
☆22Updated 4 years ago
Alternatives and similar repositories for fastfilter_cpp
Users that are interested in fastfilter_cpp are comparing it to the libraries listed below
Sorting:
- ☆51Updated 6 months ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated last year
- Clustered Elias-Fano inverted indexes.☆15Updated 7 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆44Updated 2 weeks ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆86Updated 4 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 9 months ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- Learned Monotone Minimal Perfect Hashing☆27Updated 2 months ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 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
- High-performance dictionary coding☆104Updated 8 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 5 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆26Updated 5 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆53Updated last year
- Code used in the paper "On dynamic succinct graph representations".☆11Updated 3 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated last year
- ☆38Updated 4 years ago
- C library to compute the Hamming weight of arrays☆46Updated 6 years ago
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- C++ implementation of Concise and WAH compressed bitsets☆20Updated 8 years ago
- Paper about the estimation of cardinalities from HyperLogLog sketches☆62Updated 4 years ago
- Quick sort code using AVX2 instructions☆69Updated 7 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago