CGCL-codes / BCFLinks
Better Choice Cuckoo Filter (BCF) is an efficient approximate set representation data structure. Different from the standard Cuckoo Filter (CF), BCF leverages the principle of the power of two choices to select the better candidate bucket during insertion. BCF reduces the average number of relocations of the state-of-the-art CF by 35%.
☆12Updated 6 years ago
Alternatives and similar repositories for BCF
Users that are interested in BCF are comparing it to the libraries listed below
Sorting:
- Dynamic Cuckoo Filter (DCF) is succinct data structure of approximate set representing and membership testing for large-scale dynamic dat…☆39Updated 8 years ago
- Simois is a scalable distributed stream join system, which supports efficient join operations in two streams with highly skewed data dist…☆13Updated 3 years ago
- Updatable Learned Index with Precise Positions☆62Updated 3 years ago
- ☆16Updated 4 years ago
- Sequential implementation of the Rewired Memory Array.☆19Updated 6 years ago
- Benchmarking framework for index structures on persistent memory☆89Updated 2 years ago
- FINEdex: A Fine-grained Learned Index Scheme for Scalable and Concurrent Memory Systems☆34Updated 3 years ago
- A read-optimized learned index for unsorted data☆32Updated 2 years ago
- ☆30Updated 6 years ago
- ☆15Updated 8 years ago
- A scalable distributed stream join system☆14Updated 3 years ago
- High Performance Learned Index on Persistent Memory☆48Updated 2 years ago
- A Benchmark for Learned Indexes☆293Updated 3 years ago
- "GraphOne: A Data Store for Real-time Analytics on Evolving Graphs", Usenix FAST'19☆60Updated 4 years ago
- GRE is a benchmark suite to compare learned indexes and traditional indexes.☆53Updated 3 years ago
- [VLDB 2022] NFL: Robust Learned Index via Distribution Transformation☆21Updated 2 years ago
- ☆55Updated last year
- Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)☆77Updated 3 years ago
- Reducing the cache misses of SIMD vectorization using IMV☆29Updated 3 years ago
- Tabular: Efficiently Building Efficient Indexes (VLDB 2025)☆23Updated 7 months ago
- HOT - Height Optimized Trie☆157Updated 7 years ago
- benchmark driver for "Can Learned Models Replace Hash Functions?" VLDB submission☆16Updated 2 years ago
- ☆19Updated 9 years ago
- LB+-Tree implementation☆48Updated 4 years ago
- ☆10Updated 11 years ago
- A simple implementation of the packed memory array☆20Updated 12 years ago
- ☆16Updated 8 months ago
- Benchmarking new Optane PMem-based persistent memory range indexes (VLDB 2022)☆21Updated 3 years ago
- ☆53Updated 11 months ago
- Yahoo! Cloud Serving Benchmark in C++, a C++ version of YCSB (https://github.com/brianfrankcooper/YCSB/wiki)☆167Updated 4 years ago