Network Applications of Bloom Filters: A Survey

Network Applications of Bloom Filters: A Survey (2002)

Cached

Download Links

Other Repositories/Bibliography

CiteULike

by Andrei Broder , Michael Mitzenmacher , Andrei Broder I Michael Mitzenmacher

Venue:	Internet Mathematics
Citations:	512 - 16 self

BibTeX

@INPROCEEDINGS{Broder02networkapplications,
    author = {Andrei Broder and Michael Mitzenmacher and Andrei Broder I Michael Mitzenmacher},
    title = {Network Applications of Bloom Filters: A Survey},
    booktitle = {Internet Mathematics},
    year = {2002},
    pages = {636--646}
}

OpenURL

Abstract

A Bloom filter is an ingenious randomized data-structure for concisely representing a set in order to support approximate membership queries. The space efficiency is achieved at the cost of a small probability of false positives. It was invented by Burton Bloom in 1970 for the purpose of spell checking and for many years it was seldom mentioned in other contexts, except for database optimization. Nevertheless, Bloom's beautiful approach has seen a sudden resurgence in a variety of large-scale network applications such as shared web caches, query routing, and replica location. This survey presents a plethora of recent uses of this old data structure, its modern variants, and the mathematical basis behind them, with the aim of making these ideas available to a wider community and the hope of inspiring new applications.

Keyphrases

bloom filter network application wider community many year replica location sudden resurgence recent us database optimization approximate membership query space efficiency small probability spell checking web cache large-scale network application ingenious randomized data-structure query routing mathematical basis beautiful approach false positive new application old data structure modern variant burton bloom