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 7 years ago
- Benchmarking framework for index structures on persistent memory☆89Updated 2 years ago
- Updatable Learned Index with Precise Positions☆60Updated 3 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☆31Updated 2 years ago
- A scalable distributed stream join system☆14Updated 2 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
- High Performance Learned Index on Persistent Memory☆48Updated 2 years ago
- A Benchmark for Learned Indexes☆290Updated 3 years ago
- ☆18Updated 2 weeks ago
- Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)☆36Updated 3 years ago
- Key-value store with new indexing☆37Updated 6 years ago
- Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree☆119Updated 4 years ago
- NoveLSM☆40Updated 6 years ago
- Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)☆76Updated 3 years ago
- ☆55Updated last year
- LB+-Tree implementation☆49Updated 4 years ago
- ☆16Updated 4 years ago
- An adaptive radix tree for efficient indexing in main memory.☆164Updated last year
- ☆18Updated 6 years ago
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago
- A Learned Index for Log-Structured Merge Trees☆45Updated 2 years ago
- benchmark driver for "Can Learned Models Replace Hash Functions?" VLDB submission☆16Updated last year
- HOT - Height Optimized Trie☆156Updated 7 years ago
- DINOMO: An Elastic, Scalable, High-Performance Key-Value Store for Disaggregated Persistent Memory (PVLDB 2022, VLDB 2023)☆37Updated 2 years ago
- ☆19Updated 9 years ago
- ☆121Updated 3 years ago
- ☆30Updated 6 years ago
- ☆98Updated 4 years ago
- ☆149Updated 2 years ago