wuwuz / Vacuum-FilterLinks
☆52Updated 10 months ago
Alternatives and similar repositories for Vacuum-Filter
Users that are interested in Vacuum-Filter 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
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆87Updated 4 years ago
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- ☆38Updated 5 years ago
- ☆55Updated last year
- Fast Approximate Membership Filters (C++)☆284Updated last month
- Bumped Ribbon Retrieval and Approximate Membership Query☆48Updated 3 months ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- HOT - Height Optimized Trie☆156Updated 7 years ago
- Order-preserving key encoder☆125Updated 5 years ago
- ☆30Updated 6 years ago
- pmwcas☆138Updated 2 years ago
- An adaptive radix tree for efficient indexing in main memory.☆165Updated last year
- ☆72Updated 3 weeks ago
- A fast approximate membership query data structure☆11Updated last year
- Multi-core Window-Based Stream Processing Engine☆73Updated 3 years ago
- ☆48Updated last year
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆82Updated 3 years ago
- An open-source BzTree implementation☆92Updated 4 years ago
- Scalable Structural Index Constructor for JSON Analytics☆25Updated 11 months ago
- A simple, reference implementation of a B^e-tree☆157Updated 6 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…☆123Updated 11 months ago
- A read-optimized learned index for unsorted data☆31Updated 2 years ago
- A Single-Pass Learned Index☆133Updated 2 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆91Updated 2 years ago
- FishStore is a prototype fast ingestion and querying layer for flexible-schema data☆228Updated 2 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆176Updated 9 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Software Transactional Objects☆57Updated last year