101 search results - page 5 / 21 » The Bloom paradox: When not to use a Bloom filter |
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...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
SODA
2004
ACM
13 years 8 months ago
2004
ACM
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
DBISP2P
2003
Springer
14 years 17 days ago
2003
Springer
Peer-to-peer systems are gaining popularity as a means to effectively share huge, massively distributed data collections. In this paper, we consider XML peers, that is, peers that ...