splatlab / cqf
A General-Purpose Counting Filter: Counting Quotient Filter
☆126Updated last year
Related projects ⓘ
Alternatives and complementary repositories for cqf
- a quotient filter written in C☆84Updated 7 years ago
- LSM-trie☆114Updated 3 years ago
- High-performance dictionary coding☆103Updated 7 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆85Updated 3 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆62Updated 5 months ago
- Fast Approximate Membership Filters (C++)☆263Updated 10 months ago
- Order-preserving key encoder☆122Updated 4 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 12 years ago
- HOT - Height Optimized Trie☆140Updated 6 years ago
- Simple baselines for "Learned Indexes"☆159Updated 6 years ago
- Paper about the estimation of cardinalities from HyperLogLog sketches☆61Updated 3 years ago
- Compact Data Structures Library☆124Updated 10 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆172Updated 8 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆27Updated 3 years ago
- ☆142Updated last year
- Succinct Data Structure Library 3.0☆86Updated 2 months ago
- Bloom-filter based minimal perfect hash function library☆248Updated last year
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆76Updated 2 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆130Updated 2 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- Beta release of Masstree.☆432Updated last year
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆52Updated 10 months ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 2 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆97Updated 6 years ago
- A collection of succinct data structures☆195Updated 10 months ago
- Fast differential coding functions (using SIMD instructions)☆50Updated 6 years ago
- Dynamic succinct/compressed data structures☆111Updated 6 months ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆103Updated 9 years ago
- The Cicada engine☆56Updated 7 years ago
- An adaptive radix tree for efficient indexing in main memory.☆150Updated 8 months ago