Network Applications of Bloom Filters: A Survey 论文
2004Internet Mathematics引用 1987
Caching and Content DeliveryCovalent Organic Framework ApplicationsNetwork Packet Processing and Optimization
详细信息
- 发表期刊/会议
- Internet Mathematics
- 发表日期
- 2004-01-01
- 发表年份
- 2004
关键词
Caching and Content DeliveryCovalent Organic Framework ApplicationsNetwork Packet Processing and Optimization
摘要
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.