splatlab / vqfLinks
A fast approximate membership query data structure
☆11Updated last year
Alternatives and similar repositories for vqf
Users that are interested in vqf are comparing it to the libraries listed below
Sorting:
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated 2 years ago
- ☆52Updated 8 months ago
- ☆54Updated last year
- ☆16Updated 4 years ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆103Updated 2 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- A read-optimized learned index for unsorted data☆31Updated 2 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆87Updated 4 years ago
- ☆30Updated 6 years ago
- HOT - Height Optimized Trie☆156Updated 7 years ago
- Self-Tuning Adaptive Radix Tree☆28Updated 5 years ago
- An adaptive radix tree for efficient indexing in main memory.☆162Updated last year
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- This is the source code for our (Tobias Ziegler, Carsten Binnig and Viktor Leis) published paper at SIGMOD’22: ScaleStore: A Fast and Cos…☆124Updated 10 months ago
- ☆72Updated 5 months ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- based on the work of Harald Lang when at CWI☆23Updated 5 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆166Updated 3 years ago
- Tabular: Efficiently Building Efficient Indexes (VLDB 2025)☆21Updated 4 months ago
- This is the code for our self-designing range filter as described in our SIGMOD'22 paper of the same name.☆13Updated 2 years ago
- LSM-trie☆114Updated 4 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆35Updated 6 months ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆46Updated 2 months ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Updated 2 weeks ago
- a quotient filter written in C☆86Updated 7 years ago
- ☆38Updated 5 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- A Single-Pass Learned Index☆133Updated 2 years ago
- Scalable Hashing on Persistent Memory☆194Updated last year
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago