splatlab / cqfLinks
A General-Purpose Counting Filter: Counting Quotient Filter
☆128Updated 2 years ago
Alternatives and similar repositories for cqf
Users that are interested in cqf are comparing it to the libraries listed below
Sorting:
- LSM-trie☆114Updated 4 years ago
- a quotient filter written in C☆86Updated 7 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆87Updated 4 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- Dynamic succinct/compressed data structures☆112Updated last year
- Bloom-filter based minimal perfect hash function library☆266Updated last month
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- High-performance dictionary coding☆104Updated 8 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆155Updated last year
- A collection of succinct data structures☆207Updated last year
- Compact Data Structures Library☆128Updated 10 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Compact Tree Representation☆16Updated 8 years ago
- Succinct Data Structure Library 3.0☆94Updated this week
- Count-Min sketch-based approximate counting library☆45Updated 3 months ago
- qp tries and crit-bit tries☆121Updated 3 years ago
- Paper about the estimation of cardinalities from HyperLogLog sketches☆62Updated 4 years ago
- Fast Approximate Membership Filters (C++)☆281Updated 7 months ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- HOT - Height Optimized Trie☆156Updated 7 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 3 years ago
- Order-preserving key encoder☆123Updated 5 years ago
- Compact Data Structures Library☆101Updated 3 years ago
- Simple baselines for "Learned Indexes"☆159Updated 7 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 4 years ago
- Succinct Data Structure Library☆107Updated 11 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago