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%.
☆12Jun 22, 2019Updated 6 years ago
Alternatives and similar repositories for BCF
Users that are interested in BCF are comparing it to the libraries listed below
Sorting:
- Simois is a scalable distributed stream join system, which supports efficient join operations in two streams with highly skewed data dist…☆13Jul 1, 2022Updated 3 years ago
- LDCF is a novel efficient approximate set representation structure for large-scale dynamic data sets. LDCF uses a novel multi-level tree …☆14Mar 24, 2021Updated 4 years ago
- Pensieve is a skewness-aware multi-version graph processing system that exploits the time locality of graph version access and leverages …☆21Aug 14, 2021Updated 4 years ago
- A scalable distributed stream join system☆14Nov 16, 2022Updated 3 years ago
- Argus is a novel RDMA-assisted job scheduler which achieves high resource utilization by fully exploiting the structure feature of stage …☆10Apr 13, 2021Updated 4 years ago
- RGraph is an RDMA-assisted asynchronous distributed graph processing system. RGraph distributes edges into two parts to isolate master an…☆14Apr 13, 2021Updated 4 years ago
- Dynamic Cuckoo Filter (DCF) is succinct data structure of approximate set representing and membership testing for large-scale dynamic dat…☆39Nov 16, 2017Updated 8 years ago
- Horae is a graph stream summarization structure for efficient temporal range queries. Horae can deal with temporal queries with arbitrary…☆21May 31, 2022Updated 3 years ago
- PStream is a popularity-aware differentiated distributed stream processing system, which identifies the popularity of keys in the stream …☆20Jul 1, 2022Updated 3 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆89Dec 16, 2020Updated 5 years ago
- MIT dsail research project☆12May 14, 2020Updated 5 years ago
- ☆11Oct 25, 2023Updated 2 years ago
- ☆12Jul 4, 2020Updated 5 years ago
- ☆54Nov 23, 2024Updated last year
- ☆10Nov 25, 2023Updated 2 years ago
- 图神经网络导论☆12Nov 28, 2021Updated 4 years ago
- ☆13Jun 24, 2025Updated 8 months ago
- A fast approximate membership query data structure☆12Jul 16, 2024Updated last year
- WavingSketch: An Unbiased and Generic Sketch for Finding Top-k Items in Data Streams