306 search results - page 1 / 62 » Compressed bloom filters |
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...
AINA
2007
IEEE
13 years 8 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...
SIGMOD
2003
ACM
14 years 5 months ago
2003
ACM
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...
FMCAD
2004
Springer
13 years 8 months ago
2004
Springer
Abstract. Probabilistic techniques for verification of finite-state transition systems offer huge memory savings over deterministic techniques. The two leading probabilistic scheme...