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
- a quotient filter written in C☆86Updated 8 years ago
- LSM-trie☆114Updated 4 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆88Updated 4 years ago
- Dynamic succinct/compressed data structures☆110Updated last year
- Bloom-filter based minimal perfect hash function library☆265Updated 3 months ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- A collection of succinct data structures☆210Updated last year
- Succinct Data Structure Library 3.0☆95Updated 2 months ago
- Compact Data Structures Library☆128Updated 11 years ago
- Compact Data Structures Library☆101Updated 3 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 3 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆154Updated last year
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- Fast Approximate Membership Filters (C++)☆286Updated last month
- High-performance dictionary coding☆108Updated 8 years ago
- Paper about the estimation of cardinalities from HyperLogLog sketches☆63Updated 4 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- Succinct Data Structure Library☆107Updated 12 years ago
- qp tries and crit-bit tries☆122Updated 3 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆51Updated 6 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- Count-Min sketch-based approximate counting library☆46Updated 5 months ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆50Updated last year
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated 2 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 years ago
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆43Updated 8 years ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆107Updated 10 years ago
- An efficient trie implementation.☆255Updated 4 years ago