Internet Mathematics

Network Applications of Bloom Filters: A Survey

Andrei Broder and Michael Mitzenmacher

Full-text: Open access

Abstract

A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Bloom filters allow false positives but the space savings often outweigh this drawback when the probability of an error is controlled. Bloom filters have been used in database applications since the 1970s, but only in recent years have they become popular in the networking literature. The aim of this paper is to survey the ways in which Bloom filters have been used and modified in a variety of network problems, with the aim of providing a unified mathematical and practical framework for understanding them and stimulating their use in future applications.

Article information

Source
Internet Math., Volume 1, Number 4 (2003), 485-509.

Dates
First available in Project Euclid: 23 February 2005

Permanent link to this document
https://projecteuclid.org/euclid.im/1109191032

Mathematical Reviews number (MathSciNet)
MR2119995

Zentralblatt MATH identifier
1090.68515

Citation

Broder, Andrei; Mitzenmacher, Michael. Network Applications of Bloom Filters: A Survey. Internet Math. 1 (2003), no. 4, 485--509. https://projecteuclid.org/euclid.im/1109191032


Export citation