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
- Updatable Learned Index with Precise Positions☆63Updated 3 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
- ☆18Updated 3 months ago
- Sequential implementation of the Rewired Memory Array.☆19Updated 6 years ago
- Benchmarking framework for index structures on persistent memory☆89Updated 2 years ago
- A scalable distributed stream join system☆14Updated 3 years ago
- ☆30Updated 6 years ago
- A Benchmark for Learned Indexes☆297Updated 3 years ago
- High Performance Learned Index on Persistent Memory☆49Updated 2 years ago
- A read-optimized learned index for unsorted data☆32Updated 2 years ago
- An adaptive radix tree for efficient indexing in main memory.☆167Updated last month
- Key-value store with new indexing☆36Updated 6 years ago
- ☆15Updated 8 years ago
- HOT - Height Optimized Trie☆158Updated 7 years ago
- FINEdex: A Fine-grained Learned Index Scheme for Scalable and Concurrent Memory Systems☆36Updated 3 years ago
- GRE is a benchmark suite to compare learned indexes and traditional indexes.☆54Updated 3 years ago
- LB+-Tree implementation☆48Updated 4 years ago
- Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree☆119Updated 4 years ago
- ☆56Updated last year
- "GraphOne: A Data Store for Real-time Analytics on Evolving Graphs", Usenix FAST'19☆60Updated 5 years ago
- ☆98Updated 5 years ago
- ☆125Updated 3 years ago
- ☆16Updated 4 years ago
- NoveLSM☆40Updated 7 years ago
- A library that provides an embeddable, persistent key-value store for fast storage.☆38Updated 7 years ago
- ☆53Updated last year
- Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)☆36Updated 3 years ago
- based on the work of Harald Lang when at CWI☆23Updated 5 years ago
- a fully learned index for larger-than-memory databases☆15Updated 3 years ago