splatlab / vqf
A fast approximate membership query data structure
☆11Updated 6 months ago
Alternatives and similar repositories for vqf:
Users that are interested in vqf are comparing it to the libraries listed below
- ☆50Updated last month
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated last year
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆28Updated 3 years ago
- String map implementation through Fast Succinct Trie☆21Updated 3 years ago
- ☆16Updated 3 years ago
- ☆52Updated 8 months ago
- Stand-alone implementation of the progressive indexing algorithms.☆16Updated 4 years ago
- Self-Tuning Adaptive Radix Tree☆27Updated 4 years ago
- ☆39Updated 9 months ago
- An open-source BzTree implementation☆90Updated 3 years ago
- A read-optimized learned index for unsorted data☆31Updated last year
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Implementation of Origami: A High-Performance Mergesort Framework☆26Updated last month
- ☆37Updated 4 years ago
- Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.☆23Updated 11 months ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆130Updated 3 years ago
- Clustered Elias-Fano inverted indexes.☆15Updated 6 years ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆96Updated last year
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 7 years ago
- based on the work of Harald Lang when at CWI☆23Updated 4 years ago
- ☆15Updated 7 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆40Updated last month
- This is the source code for our (Tobias Ziegler, Carsten Binnig and Viktor Leis) published paper at SIGMOD’22: ScaleStore: A Fast and Cos…☆119Updated 3 months ago
- HOT - Height Optimized Trie☆140Updated 6 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆85Updated 4 years ago
- This is the code for our self-designing range filter as described in our SIGMOD'22 paper of the same name.☆12Updated last year
- ☆23Updated 5 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 4 months ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago