Sciweavers

73 search results - page 1 / 15
» On the false-positive rate of Bloom filters
Sort
View
IPL
2010
75views more  IPL 2010»
13 years 3 months ago
A new analysis of the false positive rate of a Bloom filter
Kenneth J. Christensen, Allen Roginsky, Miguel Jim...
GLOBECOM
2007
IEEE
13 years 11 months ago
A Scalable Bloom Filter for Membership Queries
—Bloom filters allow membership queries over sets with allowable errors. It is widely used in databases, networks and distributed systems and it has great potential for distribut...
Kun Xie, Yinghua Min, Dafang Zhang, Jigang Wen, Ga...
IPL
2008
100views more  IPL 2008»
13 years 4 months ago
On the false-positive rate of Bloom filters
Bloom filters are a randomized data structure for membership queries dating back to 1970. Bloom filters sometimes give erroneous answers to queries, called false positives. Bloom a...
Prosenjit Bose, Hua Guo, Evangelos Kranakis, Anil ...
TON
2002
175views more  TON 2002»
13 years 4 months ago
Compressed bloom filters
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, f...
Michael Mitzenmacher
IPCCC
2007
IEEE
13 years 11 months ago
A Power Management Proxy with a New Best-of-N Bloom Filter Design to Reduce False Positives
Miguel Jimeno, Kenneth J. Christensen, Allen Rogin...