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.
Citations
|
2394
|
Chord: A scalable peer-to-peer lookup service for Internet applications
– Stoica, Morris, et al.
- 2001
|
|
1950
|
A scalable Content-Addressable Network
– Ratnasamy, Francis, et al.
- 2001
|
|
825
|
Space/time trade-offs in hash coding with allowable errors
– Bloom
- 1970
|
|
702
|
Oceanstore: An architecture for global-scale persistent storage
– Kubiatowicz, Bindel, et al.
- 2000
|
|
468
|
Summary cache: A scalable wide-area web cache sharing protocol
– Fan, Cao, et al.
- 2000
|
|
428
|
A scalable location service for geographic ad-hoc routing
– LI, JANNOTTI, et al.
- 2000
|
|
231
|
An Architecture for a Secure Service Discovery Service’. MobiCOM ’99
– Czerwinski, Zhao, et al.
- 1999
|
|
200
|
New directions in traffic measurement and accounting
– Estan, Varghese
- 2002
|
|
170
|
PAST: a large-scale persistent peer-to-peer storage utility
– Druschel, Rowstron
- 2001
|
|
129
|
Compressed bloom filters
– Mitzenmacher
|
|
116
|
T.D.: PlanetP: Using Gossiping to Build Content Addressable Peer-to-Peer Information Sharing Communities
– Cuenca-Acuna, Peery, et al.
- 2003
|
|
108
|
Hash-based IP Traceback
– Snoeren, Partridge, et al.
- 2001
|
|
76
|
Cache digests
– Rousskov, Wessels
- 1998
|
|
74
|
Stochastic fair blue: A queue management algorithm for enforcing fairness
– Feng, Kandlur, et al.
- 2001
|
|
34
|
Practical performance of Bloom filters and parallel free-text searching
– Ramakrishna
- 1989
|
|
31
|
Development of a spelling list
– McIlroy
- 1982
|
|
26
|
Geographical Region Summary Service for Geographical Routing
– Hsiao
- 2001
|
|
22
|
Supporting cooperative and personal surfing with a desktop assistant
– Marais, Bharat
- 1997
|
|
19
|
Optimal semijoins for distributed database systems
– Mullin
- 1990
|
|
18
|
An algorithm for approximate membership checking with application to password security
– Manber, Wu
- 1994
|
|
11
|
Forwarding without loops in Icarus
– Whitaker, Wetherall
- 2002
|
|
10
|
Fast Approximate Reconciliation of Set Differences
– Byers, Considine, et al.
- 2002
|
|
6
|
Informed content delivery over adaptive overlay networks
– Byers, Considine, et al.
- 2002
|
|
5
|
PERF join: an alternative to twoway semijoin and bloomjoin
– Li, Ross
- 1995
|
|
2
|
Efficient Peer-to-Peer Keyword Searching,” unpublished
– Reynolds, Vahdat
|
|
1
|
Scalable multicast forwarding. Available at www. acm. org/sigcomm/ccr/archive/2002/j an02/CCR-SC01-Posters/Bj ornGronvall. ps
– GrSnvall
|
|
1
|
Self-organization in peer4o-peer systems
– Ledlie, Taylor, et al.
- 2002
|
|
1
|
Opus: Preventing weak password choices. Computer and Security
– Spafiord
- 1992
|
