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. We may earn a commission when you buy through links labeled 'Ad' on this page.
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
- 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
- LDCF is a novel efficient approximate set representation structure for large-scale dynamic data sets. LDCF uses a novel multi-level tree …☆15Mar 24, 2021Updated 5 years ago
- Dynamic Cuckoo Filter (DCF) is succinct data structure of approximate set representing and membership testing for large-scale dynamic dat…☆38Nov 16, 2017Updated 8 years ago
- Wordpress hosting with auto-scaling - Free Trial Offer • AdFully Managed hosting for WordPress and WooCommerce businesses that need reliable, auto-scalable performance. Cloudways SafeUpdates now available.
- Argus is a novel RDMA-assisted job scheduler which achieves high resource utilization by fully exploiting the structure feature of stage …☆10Apr 13, 2021Updated 5 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 5 years ago
- PStream is a popularity-aware differentiated distributed stream processing system, which identifies the popularity of keys in the stream …☆23Jul 1, 2022Updated 3 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 4 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆90Dec 16, 2020Updated 5 years ago
- RDMA Large File Transfer：A Large-scale File and Folder Transfer Framework. By using two components, RDMA Channel and RDMA Verbs.☆14Jan 9, 2020Updated 6 years ago
- 图神经网络导论☆12Nov 28, 2021Updated 4 years ago
- A fast approximate membership query data structure☆12Jul 16, 2024Updated last year
- A fast, cache-efficient, concurrent bloom filter in Haskell☆19Apr 11, 2018Updated 8 years ago
- End-to-end encrypted email - Proton Mail • AdSpecial offer: 40% Off Yearly / 80% Off First Month. All Proton services are open source and independently audited for security.
- ☆54Nov 23, 2024Updated last year
- ☆12Jul 4, 2020Updated 5 years ago
- A Chrome extension that automatically adds viewed academic papers to your favorites.☆17Sep 25, 2018Updated 7 years ago
- ☆11Oct 25, 2023Updated 2 years ago
- MIT dsail research project☆12May 14, 2020Updated 6 years ago
- Benchmarking Bloom, Cuckoo, Morton, and PD based filter.☆15Mar 19, 2022Updated 4 years ago
- Compiler-assisted variable size benchmarking for the study of C++ metaprogram compile times.☆26Mar 30, 2026Updated 2 months ago
- Fast Approximate Membership Filters (C++)☆24Apr 27, 2021Updated 5 years ago
- Probabilistic Data Structure Template Library☆30Jun 18, 2020Updated 5 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Jan 8, 2023Updated 3 years ago
- benchmark driver for "Can Learned Models Replace Hash Functions?" VLDB submission☆16Oct 31, 2023Updated 2 years ago
- Ultra light-weight endian utility for C++11 (header only)☆26Jan 20, 2019Updated 7 years ago
- Measure instruction latency and throughput☆31Sep 2, 2025Updated 9 months ago
- Travelling salesman problem solved with Genetic Algorithm using Go☆18Mar 13, 2023Updated 3 years ago
- ☆16Mar 16, 2021Updated 5 years ago
- Generate and analyze small-world networks according to the revised Watts-Strogatz model where the randomization at β = 1 is truly equal t…☆21Jul 12, 2021Updated 4 years ago
- WavingSketch: An Unbiased and Generic Sketch for Finding Top-k Items in Data Streams☆15Jul 7, 2024Updated last year
- ☆13Jun 24, 2025Updated 11 months ago
- Serverless GPU API endpoints on Runpod - Get Bonus Credits • AdSkip the infrastructure headaches. Auto-scaling, pay-as-you-go, no-ops approach lets you focus on innovating your application.
- ☆13Aug 6, 2022Updated 3 years ago
- ☆16May 24, 2022Updated 4 years ago
- More SageMath Tutorials: A place to share and evolve tutorials for Sage, with the aim to contribute them to Sage☆31Oct 13, 2023Updated 2 years ago
- ☆19Mar 13, 2016Updated 10 years ago
- ☆39Feb 2, 2021Updated 5 years ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Aug 9, 2023Updated 2 years ago
- This repository contains the open source of the Pyramid sketch framework (accepted by VLDB 2017 and then submitted to ToN).☆21Sep 29, 2018Updated 7 years ago