CoChat

Cuckoo Filter: Practically Better Than Bloom

Fan, Bin, Andersen, Dave G., Kaminsky, Michael, Mitzenmacher, Michael D. · 2014 · Proceedings of the 10th ACM International on Conference on emerging Networking Experiments and Technologies

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

Crossref · 10.1145/2674005.2674994

Cites

28 of 28 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Research works printed but not linked: 3

  1. 10.5555/2133036.2133129 · doi:10.5555/2133036.2133129
  2. 10.1002/rsa.v33:2 · doi:10.1002/rsa.v33:2
  3. 10.5555/1768570.1768582 · doi:10.5555/1768570.1768582

Cited by

See all 946

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

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.