splatlab / cqf
A General-Purpose Counting Filter: Counting Quotient Filter
☆127Updated last year
Alternatives and similar repositories for cqf:
Users that are interested in cqf are comparing it to the libraries listed below
- a quotient filter written in C☆84Updated 7 years ago
- LSM-trie☆113Updated 4 years ago
- High-performance dictionary coding☆104Updated 7 years ago
- HOT - Height Optimized Trie☆148Updated 6 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated 9 months ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆85Updated 4 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 12 years ago
- Succinct Data Structure Library 3.0☆94Updated 6 months ago
- Compact Data Structures Library☆124Updated 10 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆174Updated 8 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Fast Approximate Membership Filters (C++)☆274Updated 2 months ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 3 years ago
- Paper about the estimation of cardinalities from HyperLogLog sketches☆62Updated 3 years ago
- Order-preserving key encoder☆122Updated 4 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆153Updated 8 months ago
- Beta release of Masstree.☆440Updated last year
- Compact Data Structures Library☆98Updated 2 years ago
- Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs☆10Updated 9 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆179Updated 7 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆130Updated 3 years ago
- ☆143Updated 2 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 6 years ago
- A library of inverted index data structures☆148Updated 2 years ago
- Dynamic succinct/compressed data structures☆112Updated 10 months ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 3 years ago
- A library that provides an embeddable, persistent key-value store for fast storage.☆38Updated 6 years ago
- Fast differential coding functions (using SIMD instructions)☆52Updated 7 years ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated last year