The DOI matches its Crossref record; 53 of the 53 references it cites were found in a registry or an index.
Theory and Practice of Bloom Filters for Distributed Systems
Abstract
Many network solutions and overlay networks utilize probabilistic techniques to reduce information processing and networking costs. This survey article presents a number of frequently used and useful probabilistic techniques. Bloom filters and their variants are of prime importance, and they are heavily used in various distributed systems. This has been reflected in recent research and many new algorithms have been proposed for distributed systems that are either directly or indirectly based on Bloom filters. In this survey, we give an overview of the basic and advanced techniques, reviewing over 20 variants and discussing their application in distributed systems, in particular for caching, peer-to-peer systems, routing and forwarding, and measurement data summarization.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
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
(1999) · Cited by 3,186
OceanStore: an architecture for global-scale persistent storage
Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., et al. (2000) · ACM SIGPLAN Notices · doi:10.1145/356989.357007 · Cited by 2,002
Network Applications of Bloom Filters: A Survey
Broder, A., & Mitzenmacher, M. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129096 · Cited by 1,991
Bigtable: a distributed storage system for structured data
Chang, F. W., Dean, J. B., Ghemawat, S., Hsieh, W. C., Wallach, D. A., Burrows, M., Chandra, T., Fikes, A., & Gruber, R. E. (2006) · doi:10.5555/1298455.1298475 · Cited by 1,928
Summary 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
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
Andoni, A., & Indyk, P. (2008) · Communications of the ACM · doi:10.1145/1327452.1327494 · Cited by 1,437
Pagh, R., & Rodler, F. F. (2004) · Journal of Algorithms · doi:10.1016/j.jalgor.2003.12.002 · Cited by 1,045
Issues in data stream management
Golab, L., & ÖZSU, M. T. (2003) · ACM SIGMOD Record · doi:10.1145/776985.776986 · Cited by 964
The BLUE active queue management algorithms
Feng, W.-C., Shin, K. G., Kandlur, D. D., & Saha, D. (2002) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.801399 · Cited by 576
Cited by
Software-Defined Networking: A Comprehensive Survey
Kreutz, D., Ramos, F. M. V., Esteves Verissimo, P., Esteve Rothenberg, C., Azodolmolky, S., & Uhlig, S. (2015) · Proceedings of the IEEE · doi:10.1109/jproc.2014.2371999 · Cited by 5,050
Named Data Networking: A survey
Saxena, D., Raychoudhury, V., Suri, N., Becker, C., & Cao, J. (2016) · Computer Science Review · doi:10.1016/j.cosrev.2016.01.001 · Cited by 291
Lighter: fast and memory-efficient sequencing error correction without counting
Song, L., Florea, L., & Langmead, B. (2014) · Genome Biology · doi:10.1186/preaccept-9663167051308943 · Cited by 258
Kleyko, D., Rachkovskij, D., Osipov, E., & Rahimi, A. (2023) · ACM Computing Surveys · doi:10.1145/3558000 · Cited by 141
Preventing generation of verbatim memorization in language models gives a false sense of privacy
Ippolito, D., Tramer, F., Nasr, M., Zhang, C., Jagielski, M., Lee, K., Choquette Choo, C., & Carlini, N. (2023) · Proceedings of the 16th International Natural Language Generation Conference · doi:10.18653/v1/2023.inlg-main.3 · Cited by 28
“See Tarkoma et al. (2011) for the full calculations, which the ones listed here are taken from.”
Background
Metadata
- Authors
- Tarkoma, S., Rothenberg, C. E., & Lagerspetz, E.
- Venue
- IEEE Communications Surveys & Tutorials
- Published
- 2012
- Volume
- 14
- Issue
- 1
- Pages
- 131-155
- ISSN
- 1553-877X (ISSN-L)
- OpenAlex
- W2074633331
- Cited by
- 518
- References
- 53
- FWCI
- 23.65
- Type
- journal article
- Language
- en
- Open access
- closed
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: Theory and Practice of Bloom Filters for Distributed Systems. https://app.cochat.ai/papers/10.1109/surv.2011.031611.00024
- The paper
- Tarkoma, S., Rothenberg, C. E., & Lagerspetz, E. (2012). Theory and Practice of Bloom Filters for Distributed Systems. IEEE Communications Surveys & Tutorials. https://doi.org/10.1109/surv.2011.031611.00024
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.