pdillinger / fastfilter_cpp
Fast Approximate Membership Filters (C++)
☆21Updated 3 years ago
Alternatives and similar repositories for fastfilter_cpp:
Users that are interested in fastfilter_cpp are comparing it to the libraries listed below
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆41Updated last week
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated last year
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- ☆50Updated 3 months ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- The dream accurate approximate set cardinality estimator based on 3-bit HyperLogLog. More accurate than Redis HyperLogLog.☆55Updated 3 years ago
- Clustered Elias-Fano inverted indexes.☆15Updated 6 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- Fast algorithms for computing XX^T for binary matrices☆14Updated 5 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- C++ Implementation of Zip Trees☆14Updated 2 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 6 months ago
- Bloom filter alternative (C++)☆17Updated 6 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆85Updated 4 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆26Updated 5 years ago
- Shuffle-based predicate matcher and all-round branch free swiss army chainsaw☆17Updated 6 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆49Updated 10 months ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆55Updated 2 years ago
- Persistent Memory Graph Database☆44Updated 2 years ago
- Succinct data structures in C/C++☆85Updated 5 months ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 5 years ago
- Quick sort code using AVX2 instructions☆68Updated 7 years ago
- String map implementation through Fast Succinct Trie☆21Updated 3 years ago
- SIMDized check which bytes are in a set☆28Updated 6 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- Learned Monotone Minimal Perfect Hashing☆25Updated 3 months ago