splatlab / cqf
A General-Purpose Counting Filter: Counting Quotient Filter
☆124Updated last year
Related projects: ⓘ
- a quotient filter written in C☆83Updated 7 years ago
- LSM-trie☆115Updated 3 years ago
- HOT - Height Optimized Trie☆138Updated 6 years ago
- Compact Data Structures Library☆123Updated 10 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆61Updated 3 months ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆26Updated 3 years ago
- Fast Approximate Membership Filters (C++)☆258Updated 8 months ago
- Order-preserving key encoder☆121Updated 4 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆84Updated 3 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 12 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆46Updated 2 years ago
- High-performance dictionary coding☆102Updated 7 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆168Updated 8 years ago
- A collection of succinct data structures☆193Updated 8 months ago
- Paper about the estimation of cardinalities from HyperLogLog sketches☆61Updated 3 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 2 years ago
- Bloom-filter based minimal perfect hash function library☆244Updated last year
- Simple baselines for "Learned Indexes"☆157Updated 6 years ago
- ☆142Updated last year
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆52Updated 8 months ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆128Updated 2 years ago
- Dynamic succinct/compressed data structures☆111Updated 4 months ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆153Updated last month
- Compact Data Structures Library☆97Updated 2 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆96Updated 6 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆176Updated 6 years ago
- Fast differential coding functions (using SIMD instructions)☆49Updated 6 years ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆32Updated last year
- Beta release of Masstree.☆427Updated 11 months ago
- A Profiler for Identifying the Major Sources of Performance Variance in Modern Applications☆94Updated 6 years ago