369 search results - page 3 / 74 » Scalable Bloom Filters |
SIGMOD
2003
ACM
14 years 6 months ago
2003
ACM
IPL
2008
13 years 6 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...
AINA
2007
IEEE
13 years 10 months ago
2007
IEEE
Bloom filter based algorithms have proven successful as very efficient technique to reduce communication costs of database joins in a distributed setting. However, the full potent...
TON
2002
13 years 5 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...
INFOCOM
2012
IEEE
11 years 8 months ago
2012
IEEE
—In this paper, we uncover the Bloom paradox in Bloom filters: sometimes, it is better to disregard the query results of Bloom filters, and in fact not to even query them, thus...