Network Applications of Bloom Filters: A Survey

@misc{citeulike:1371118, 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...}, author = {Broder, A. and Mitzenmacher, M. }, citeulike-article-id = {1371118}, keywords = {bloom, filter, graphs, networks}, posted-at = {2007-11-20 23:15:04}, priority = {0}, title = {Network Applications of Bloom Filters: A Survey}, url = {http://citeseer.ist.psu.edu/broder02network.html}, year = {2002} }

TY - GEN ID - citeulike:1371118 L3 - citeulike-article-id:1371118 TI - Network Applications of Bloom Filters: A Survey N2 - 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... KW - bloom KW - filter KW - graphs KW - networks AU - Broder, A AU - Mitzenmacher, M PY - 2002/// UR - http://citeseer.ist.psu.edu/broder02network.html ER -