785 search results - page 6 / 157 » The Dynamic Bloom Filters |
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...
SODA
2004
ACM
13 years 9 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 22 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 ...
GLOBECOM
2007
IEEE
14 years 1 months ago
2007
IEEE
—Bloom filters allow membership queries over sets with allowable errors. It is widely used in databases, networks and distributed systems and it has great potential for distribut...
FCCM
2004
IEEE
13 years 11 months ago
2004
IEEE
Network Intrusion Detection and Prevention Systems (IDPS) use string matching to scan Internet packets for malicious content. Bloom filters offer a mechanism to search for a large...