CGCL-codes / BCF
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 5 years ago
Alternatives and similar repositories for BCF:
Users that are interested in BCF are comparing it to the libraries listed below
- Simois is a scalable distributed stream join system, which supports efficient join operations in two streams with highly skewed data dist…☆13Updated 2 years ago
- A scalable distributed stream join system☆14Updated 2 years ago
- Argus is a novel RDMA-assisted job scheduler which achieves high resource utilization by fully exploiting the structure feature of stage …☆10Updated 4 years ago
- RGraph is an RDMA-assisted asynchronous distributed graph processing system. RGraph distributes edges into two parts to isolate master an…☆14Updated 4 years ago
- LDCF is a novel efficient approximate set representation structure for large-scale dynamic data sets. LDCF uses a novel multi-level tree …☆14Updated 4 years ago
- Horae is a graph stream summarization structure for efficient temporal range queries. Horae can deal with temporal queries with arbitrary…☆21Updated 2 years ago
- Dynamic Cuckoo Filter (DCF) is succinct data structure of approximate set representing and membership testing for large-scale dynamic dat…☆39Updated 7 years ago
- Pensieve is a skewness-aware multi-version graph processing system that exploits the time locality of graph version access and leverages …☆20Updated 3 years ago
- PStream is a popularity-aware differentiated distributed stream processing system, which identifies the popularity of keys in the stream …☆15Updated 2 years ago
- Updatable Learned Index with Precise Positions☆56Updated 3 years ago
- [VLDB 2022] NFL: Robust Learned Index via Distribution Transformation☆20Updated last year
- A Distribution-driven Learned Index☆14Updated last year
- FINEdex: A Fine-grained Learned Index Scheme for Scalable and Concurrent Memory Systems☆32Updated 3 years ago
- GRE is a benchmark suite to compare learned indexes and traditional indexes.☆50Updated 2 years ago
- A read-optimized learned index for unsorted data☆31Updated last year
- Revisiting Secondary Indexing in LSM-based Storage Systems with Persistent Memory☆17Updated last year
- High Performance Learned Index on Persistent Memory☆47Updated 2 years ago
- FITing Tree is an indexing data structure that efficiently uses the memory without sacrificing the performance. For the paper: https://dl…☆11Updated 3 years ago
- a fully learned index for larger-than-memory databases☆14Updated 2 years ago
- Interactive Benchmarking of Persistent Memory Indexes☆16Updated 2 years ago
- ☆16Updated 2 years ago
- A set of learned index papers w/o notes☆16Updated last year
- A Learned Index for Log-Structured Merge Trees☆45Updated last year
- Optimistic queue-based reader-writer lock for robust index synchronization (SIGMOD 2024)☆24Updated 11 months ago
- A persistent learned index for non-volatile memory with high read/write performance.☆16Updated 2 years ago
- ☆17Updated 2 years ago
- ☆41Updated last year
- ☆14Updated last year
- ☆16Updated 4 years ago
- Benchmarking new Optane PMem-based persistent memory range indexes (VLDB 2022)☆20Updated 2 years ago