splatlab / cqfLinks
A General-Purpose Counting Filter: Counting Quotient Filter
☆132Updated 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☆88Updated 8 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆66Updated last year
- Bloom-filter based minimal perfect hash function library☆271Updated 6 months ago
- Dynamic succinct/compressed data structures☆114Updated last month
- A collection of succinct data structures☆211Updated 2 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆89Updated 5 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated 2 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆158Updated last year
- Compact Data Structures Library☆129Updated 11 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 3 years ago
- Succinct Data Structure Library 3.0☆101Updated last month
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- Compact Data Structures Library☆103Updated 3 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 6 years ago
- Fast Approximate Membership Filters (C++)☆288Updated 5 months ago
- Paper about the estimation of cardinalities from HyperLogLog sketches☆64Updated 4 years ago
- qp tries and crit-bit tries☆124Updated 3 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆33Updated 4 years ago
- High-performance dictionary coding☆109Updated 8 years ago
- Rolling Hash C++ Library☆190Updated last year
- A library of inverted index data structures☆151Updated 3 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆178Updated 3 years ago
- Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs☆11Updated 9 years ago
- Succinct Data Structure Library☆109Updated 12 years ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆108Updated 11 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆121Updated 8 years ago
- Diskbased (persistent) hashtable☆166Updated last year
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 4 years ago