19 search results - page 1 / 4 » A Memory-Optimized Bloom Filter Using an Additional Hashing ... |
GLOBECOM
2008
IEEE
13 years 10 months ago
2008
IEEE
— A Bloom filter is a simple space-efficient randomized data structure for the representation set of items in order to support membership queries. In recent years, Bloom filte...
ESA
2006
Springer
13 years 8 months ago
2006
Springer
A standard technique from the hashing literature is to use two hash functions h1(x) and h2(x) to simulate additional hash functions of the form gi(x) = h1(x) + ih2(x). We demonstra...
INFOCOM
2012
IEEE
11 years 6 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...
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...
ESA
2006
Springer
13 years 8 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...