306 search results - page 2 / 62 » Compressed bloom filters |
INFOCOM
2012
IEEE
11 years 7 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...
TKDE
2010
13 years 3 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...
LCN
2002
IEEE
13 years 10 months ago
2002
IEEE
We investigate methods of using CRC32 for compressing Web URL strings and sharing of URL lists between servers, caches, and URL switches. Using trace-based evaluation, we compare ...
ESA
2006
Springer
13 years 9 months ago
2006
Springer
A counting Bloom filter (CBF) generalizes a Bloom filter data structure so as to allow membership queries on a set that can be changing dynamically via insertions and deletions. As...
LCN
2008
IEEE
13 years 11 months ago
2008
IEEE
— Bloom filters are a well known data structure for approximate set membership. Bloom filters are space efficient but require many independent hashes and consecutive memory acces...