Sciweavers

369 search results - page 7 / 74
» Scalable Bloom Filters
Sort
View
ICPP
2006
IEEE
14 years 1 months ago
False Rate Analysis of Bloom Filter Replicas in Distributed Systems
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...
Yifeng Zhu, Hong Jiang
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
13 years 8 months ago
The Bloomier filter: an efficient data structure for static support lookup tables
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...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...
DBISP2P
2003
Springer
100views Database» more  DBISP2P 2003»
14 years 17 days ago
Content-Based Overlay Networks for XML Peers Based on Multi-level Bloom Filters
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 ...
Georgia Koloniari, Yannis Petrakis, Evaggelia Pito...
FCCM
2004
IEEE
163views VLSI» more  FCCM 2004»
13 years 11 months ago
Implementation Results of Bloom Filters for String Matching
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...
Michael Attig, Sarang Dharmapurikar, John W. Lockw...
INFOCOM
2006
IEEE
14 years 1 months ago
Theory and Network Applications of Dynamic Bloom Filters
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...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo