17 search results - page 1 / 4 » A Scalable Bloom Filter for Membership Queries |
GLOBECOM
2007
IEEE
13 years 11 months ago
2007
IEEE
—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...
IPL
2007
13 years 4 months ago
2007
Bloom Filters provide space-efficient storage of sets at the cost of a probability of false positives on membership queries. The size of the filter must be defined a priori bas...
IPL
2008
13 years 4 months ago
2008
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...
TON
2002
13 years 4 months ago
2002
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...
TKDE
2010
13 years 2 months ago
2010
—A Bloom filter is an effective, space-efficient data structure for concisely representing a set, and supporting approximate membership queries. Traditionally, the Bloom filter a...