Cuckoo Filter: Practically Better Than Bloom
The DOI matches its Crossref record; 28 of the 30 references it cites were found in a registry or an index.
Abstract
In many networking systems, Bloom filters are used for high-speed set membership tests. They permit a small fraction of false positive answers with very good space efficiency. However, they do not permit deletion of items from the set, and previous attempts to extend "standard" Bloom filters to support deletion all degrade either space or performance.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Space/time trade-offs in hash coding with allowable errors
Bloom, B. H. (1970) · Communications of the ACM · doi:10.1145/362686.362692 · Cited by 7,492
Network Applications of Bloom Filters: A Survey
Broder, A., & Mitzenmacher, M. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129096 · Cited by 1,991
Self-citationSummary cache: a scalable wide-area Web cache sharing protocol
Fan, L., Cao, P., Almeida, J., & Broder, A. Z. (2000) · IEEE/ACM Transactions on Networking · doi:10.1109/90.851975 · Cited by 1,811
Pagh, R., & Rodler, F. F. (2004) · Journal of Algorithms · doi:10.1016/j.jalgor.2003.12.002 · Cited by 1,045
LIPSIN: line speed publish/subscribe inter-networking
Jokela, P., Zahemszky, A., Esteve Rothenberg, C., Arianfar, S., & Nikander, P. (2009) · Proceedings of the ACM SIGCOMM 2009 conference on Data communication · doi:10.1145/1592568.1592592 · Cited by 434
The Power of Two Random Choices: A Survey of Techniques and Results
Mitzenmacher, M., Richa, A. W., & Sitaraman, R. (2001) · Combinatorial Optimization · doi:10.1007/978-1-4615-0013-1_9 · Cited by 431
Self-citationSummary cache: a scalable wide-area Web cache sharing protocol
Fan, L., Cao, P., Almeida, J., & Broder, A. Z. (1998) · Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/285237.285287 · Cited by 422
An Improved Construction for Counting Bloom Filters
Bonomi, F., Mitzenmacher, M., Panigrahy, R., Singh, S., & Varghese, G. (2006) · Lecture Notes in Computer Science · doi:10.1007/11841036_61 · Cited by 383
Self-citationFast hash table lookup using extended bloom filter: an aid to network processing
Song, H., Dharmapurikar, S., Turner, J., & Lockwood, J. (2005) · Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1080091.1080114 · Cited by 328
The Bloomier filter: an efficient data structure for static support lookup tables
Chazelle, B., Kilian, J., Rubinfeld, R., & Tal, A. (2004) · doi:10.5555/982792.982797 · Cited by 327
Research works printed but not linked: 3
- 10.5555/2133036.2133129 · doi:10.5555/2133036.2133129
- 10.1002/rsa.v33:2 · doi:10.1002/rsa.v33:2
- 10.5555/1768570.1768582 · doi:10.5555/1768570.1768582
Cited by
The Case for Learned Index Structures
Kraska, T., Beutel, A., Chi, E. H., Dean, J., & Polyzotis, N. (2018) · Proceedings of the 2018 International Conference on Management of Data · doi:10.1145/3183713.3196909 · Cited by 956
Elastic sketch: adaptive and fast network-wide measurements
Yang, T., Jiang, J., Liu, P., Huang, Q., Gong, J., Zhou, Y., Miao, R., Li, X., & Uhlig, S. (2018) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/3230543.3230544 · Cited by 725
A Survey of COVID-19 Contact Tracing Apps
Ahmed, N., Michelin, R. A., Xue, W., Ruj, S., Malaney, R., Kanhere, S. S., Seneviratne, A., Hu, W., Janicke, H., & Jha, S. K. (2020) · IEEE Access · doi:10.1109/access.2020.3010226 · Cited by 582
SilkRoad: Making Stateful Layer-4 Load Balancing Fast and Cheap Using Switching ASICs
Miao, R., Zeng, H., Kim, C., Lee, J., & Yu, M. (2017) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/3098822.3098824 · Cited by 525
SPACF: A Secure Privacy-Preserving Authentication Scheme for VANET With Cuckoo Filter
Cui, J., Zhang, J., Zhong, H., & Xu, Y. (2017) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2017.2718101 · Cited by 248
Metadata
- Authors
- Fan, B., Andersen, D. G., Kaminsky, M., & Mitzenmacher, M. D.
- Affiliations
- Carnegie Mellon University (US)
- Intel (United States) (US)
- Harvard University (US)
- Venue
- Proceedings of the 10th ACM International on Conference on emerging Networking Experiments and Technologies
- Publisher
- ACM
- Published
- 2014-12-02
- Pages
- 75-88
- OpenAlex
- W1967373117
- Cited by
- 737
- References
- 30
- Citations by year
- 2026: 55 · 2025: 78 · 2024: 90 · 2023: 85 · 2022: 79 · 2021: 83 · 2020: 79 · 2019: 81 · 2018: 49 · 2017: 35 · 2016: 14 · 2015: 8 · 2014: 1
- FWCI
- 11.39
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- ACM International Conference on emerging Networking EXperiments and Technologies (CoNEXT) (publishedVersion)
- Funders
- Division of Computer and Network Systems (CCF-0964474, CNS-1040801, CCF-1320231, CNS-1228598, and IIS-0964473)
- Division of Computing and Communication Foundations (CCF-0964474, CNS-1040801, CCF-1320231, CNS-1228598, and IIS-0964473)
- Division of Information and Intelligent Systems (CCF-0964474, CNS-1040801, CCF-1320231, CNS-1228598, and IIS-0964473)
- Topics
- Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
- Physical Sciences › Computer Science › Hardware and Architecture › Network Packet Processing and Optimization
- Physical Sciences › Computer Science › Information Systems › Advanced Database Systems and Queries
- Keywords
- cuckoo filter, Bloom filter, false positives, space efficiency, data structures
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Cuckoo Filter: Practically Better Than Bloom. https://app.cochat.ai/papers/10.1145/2674005.2674994
- The paper
- Fan, B., Andersen, D. G., Kaminsky, M., & Mitzenmacher, M. D. (2014). Cuckoo Filter: Practically Better Than Bloom. Proceedings of the 10th ACM International on Conference on emerging Networking Experiments and Technologies. https://doi.org/10.1145/2674005.2674994
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.