Network Applications of Bloom Filters: A Survey

By Andrei Z. Broder, Michael M. Mitzenmacher. 2004

2,380 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Hardware and Architecture, Materials Chemistry, Algorithms & Complexity

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Hardware and Architecture

In Materials Chemistry

In Algorithms & Complexity

Citations in the corpus

Data Portraits: Recording Foundation Model Training Data (2023, background): “See Broder and Mitzenmacher [7] for further details and derivations of hash collision rates.”
Secure Federated Submodel Learning (2019, background): “According to [68], [69], its detailed formula is given as”
Non-commercial Research and Educational Use including without Limitation Use in Instruction at Your Institution, Sending It to Specific Colleagues That You Know, and Providing a Copy to Your Institution's Administrator. All Other Uses, Reproduction and Distribution, including without Limitation Comm (2005, neutral): “…in a uniaxial nematic liquid crystal is given by: H ¼ X l m l I Z;l þ X l<m J lm I l Á I m þ X l<m D lm ð3I Z;l I Z;m À I l Á I m Þ ð1Þ where m l is the resonance frequency of nucleus l and J lm and D lm are the indirect spin–spin and the direct dipole–dipole couplings between nuclei l and m.”
ChunkStash: Speeding Up Inline Storage Deduplication Using Flash Memory (2010, methodology): “In order to reduce the disk accesses, HYDRAstor uses bloom filter [13] in RAM.”
Cuckoo Filter: Practically Better Than Bloom (2014, methodology): “Bloom ﬁlters have been used to: reduce the space required in probabilistic routing tables [25]; speed longest-preﬁx matching for IP addresses [9]; improve network state management and monitoring [24, 4]; and encode multicast forwarding information in packets [15], among many other applications [6].”
Botz-4-sale: surviving organized DDoS attacks that mimic flash crowds (2005, background): “3 Resource Allocation & Admission Control (4)Please refer to [15] for a general description of the Bloom fil ter.”
Algorithms with predictions (2020, background): “Bloom ﬁlters were originally developed by Bloom (1970), and have proven useful for a number of applications (Broder and Mitzenmacher, 2004).”
The Algorithm Design Manual (2020, result): “Bloom filters are ably surveyed in [BM05], with recent experimental results presented in [PSS07].”
Packet Transactions: High-Level Programming for Line-Rate Switches (2015, background): “Bloom filter [37] (3 hash functions) Set membership bit on every packet.”
SDDR: Light-Weight, Secure Mobile Encounters (2014, background): “However, none of the protocols address the precise problem and security requirements of SDDR. Secure indexes are data structures that allow queriers to perform membership tests for a given word in O(1) time if they have knowledge of the associated secret.”
The Case for Learned Index Structures (2017, background): “While traditional Bloom filters guarantee a false negative rate (FNR) of zero and a specific false positive rate (FPR) for any set of queries chosen a-priori [22], we follow the notion that we want to provide a specific FPR for realistic queries in particular while maintaining a FNR of zero.”
Theory and Practice of Bloom Filters for Distributed Systems (2012, background): “Broder and Mitzenmacher have coined the Bloom filter principle [1]:”
A taxonomy of privacy-preserving record linkage techniques (2013, methodology): “The Bloom filter was proposed by Bloom [111] for efficiently checking set membership [112].”
A Novel Error-Tolerant Anonymous Linking Code (2011, methodology): “A Bloom filter is a data structure proposed by Bloom [39] for checking set membership efficiently [40].”