splatlab / cqfLinks
A General-Purpose Counting Filter: Counting Quotient Filter
☆127Updated last year
Alternatives and similar repositories for cqf
Users that are interested in cqf are comparing it to the libraries listed below
Sorting:
- Dynamic succinct/compressed data structures☆112Updated last year
- LSM-trie☆114Updated 4 years ago
- Paper about the estimation of cardinalities from HyperLogLog sketches☆62Updated 4 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- a quotient filter written in C☆84Updated 7 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆86Updated 4 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- Bloom-filter based minimal perfect hash function library☆265Updated 2 years ago
- Succinct Data Structure Library 3.0☆94Updated 2 months ago
- Compact Data Structures Library☆126Updated 10 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆155Updated 11 months ago
- High-performance dictionary coding☆104Updated 8 years ago
- A collection of succinct data structures☆204Updated last year
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆49Updated 5 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 3 years ago
- Fast Approximate Membership Filters (C++)☆279Updated 6 months ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- Compact Data Structures Library☆100Updated 3 years ago
- HOT - Height Optimized Trie☆154Updated 7 years ago
- Rolling Hash C++ Library☆187Updated last year
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆107Updated 10 years ago
- Succinct Data Structure Library☆106Updated 11 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 3 years ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated last year
- Succinct C++☆24Updated 4 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- qp tries and crit-bit tries☆120Updated 3 years ago
- Your worst case is our best case.☆138Updated 8 years ago
- A library of inverted index data structures☆150Updated 2 years ago