239 search results - page 5 / 48 » Blooms |
TPDS
2010
13 years 5 months ago
2010
—One widely used mechanism for representing membership of a set of items is the simple space-efficient randomized data structure known as Bloom filters. Yet, Bloom filters are no...
EDBT
2004
ACM
14 years 7 months ago
2004
ACM
Peer-to-peer (P2P) systems are gaining increasing popularity as a scalable means to share data among a large number of autonomous nodes. In this paper, we consider the case in whic...
ISVLSI
2006
IEEE
14 years 1 months ago
2006
IEEE
Many network security applications require large virus signature sets to be maintained, retrieved, and compared against the network streams. Software applications frequently fail ...
ESA
2006
Springer
13 years 11 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...
ICPP
2006
IEEE
14 years 1 months ago
2006
IEEE
Recently, Bloom filters have been widely used in distributed systems where they are replicated to process distributed queries. Bloom filter replicas become stale in a dynamic en...