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:
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- Dynamic succinct/compressed data structures☆110Updated last year
- LSM-trie☆114Updated 4 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆87Updated 4 years ago
- a quotient filter written in C☆86Updated 8 years ago
- Bloom-filter based minimal perfect hash function library☆265Updated 2 months ago
- A collection of succinct data structures☆209Updated last year
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 3 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- Compact Data Structures Library☆101Updated 3 years ago
- Succinct Data Structure Library 3.0☆95Updated last month
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆154Updated last year
- Fast Approximate Membership Filters (C++)☆284Updated last month
- Succinct Data Structure Library☆107Updated 12 years ago
- Count-Min sketch-based approximate counting library☆45Updated 4 months ago
- Compact Data Structures Library☆128Updated 11 years ago
- High-performance dictionary coding☆106Updated 8 years ago
- Compact Tree Representation☆16Updated 8 years ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆50Updated 6 years ago
- A library of inverted index data structures☆150Updated 2 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- Paper about the estimation of cardinalities from HyperLogLog sketches☆62Updated 4 years ago
- Fast decoder for VByte-compressed integers☆125Updated last year
- Rolling Hash C++ Library☆188Updated last year
- An efficient trie implementation.☆255Updated 4 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 3 years ago