wuwuz / Vacuum-Filter
☆51Updated 5 months ago
Alternatives and similar repositories for Vacuum-Filter:
Users that are interested in Vacuum-Filter are comparing it to the libraries listed below
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated last year
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆86Updated 4 years ago
- ☆38Updated 4 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 3 years ago
- A fast approximate membership query data structure☆11Updated 9 months ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆44Updated last month
- based on the work of Harald Lang when at CWI☆23Updated 5 years ago
- ☆53Updated 11 months ago
- Self-Tuning Adaptive Radix Tree☆27Updated 5 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- A read-optimized learned index for unsorted data☆31Updated last year
- ☆29Updated 5 years ago
- ☆16Updated 4 years ago
- Fast Approximate Membership Filters (C++)☆278Updated 4 months ago
- Order-preserving key encoder☆122Updated 5 years ago
- HOT - Height Optimized Trie☆150Updated 7 years ago
- Parallel Balanced Binary Tree Structures☆116Updated last month
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 6 years ago
- Implementation of Origami: A High-Performance Mergesort Framework☆27Updated 5 months ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- Fast Approximate Membership Filters (C++)☆22Updated 4 years ago
- Implementation and artifacts for "User-Defined Operators: Efficiently Integrating Custom Algorithms into Modern Databases"☆23Updated last year
- a quotient filter written in C☆84Updated 7 years ago
- ☆46Updated last year
- Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.☆25Updated last year
- An open-source BzTree implementation☆92Updated 3 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆79Updated 3 years ago
- ☆12Updated 6 years ago
- A query compiler for GPUs that translates relational algebra to Cuda.☆20Updated last year
- ☆68Updated last month