Sciweavers

INFOCOM
2012
IEEE
12 years 1 months ago
The Bloom paradox: When not to use a Bloom filter?
—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...
Ori Rottenstreich, Isaac Keslassy
INFOCOM
2012
IEEE
12 years 1 months ago
The Variable-Increment Counting Bloom Filter
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...
Ori Rottenstreich, Yossi Kanizo, Isaac Keslassy
IPL
2007
111views more  IPL 2007»
13 years 11 months ago
Scalable Bloom Filters
Bloom Filters provide space-efficient storage of sets at the cost of a probability of false positives on membership queries. The size of the filter must be defined a priori bas...
Paulo Sérgio Almeida, Carlos Baquero, Nuno ...
IPL
2008
100views more  IPL 2008»
13 years 11 months ago
On the false-positive rate of Bloom filters
Bloom filters are a randomized data structure for membership queries dating back to 1970. Bloom filters sometimes give erroneous answers to queries, called false positives. Bloom a...
Prosenjit Bose, Hua Guo, Evangelos Kranakis, Anil ...
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
14 years 24 days 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...
ACSAC
2008
IEEE
14 years 1 months ago
Practical Applications of Bloom Filters to the NIST RDS and Hard Drive Triage
Much effort has been expended in recent years to create large sets of hash codes from known files. Distributing these sets has become more difficult as these sets grow larger. Mea...
Paul F. Farrell Jr., Simson L. Garfinkel, Douglas ...
FMCAD
2004
Springer
14 years 3 months ago
Bloom Filters in Probabilistic Verification
Abstract. Probabilistic techniques for verification of finite-state transition systems offer huge memory savings over deterministic techniques. The two leading probabilistic scheme...
Peter C. Dillinger, Panagiotis Manolios
FCCM
2004
IEEE
163views VLSI» more  FCCM 2004»
14 years 3 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...
DEXA
2004
Springer
91views Database» more  DEXA 2004»
14 years 3 months ago
Efficient Processing of Distributed Iceberg Semi-joins
The Iceberg SemiJoin (ISJ) of two datasets R and S returns the tuples in R which join with at least k tuples of S. The ISJ operator is essential in many practical applications incl...
Mohammed Kasim Imthiyaz, Dong Xiaoan, Panos Kalnis
AINA
2007
IEEE
14 years 3 months ago
Improving distributed join efficiency with extended bloom filter operations
Bloom filter based algorithms have proven successful as very efficient technique to reduce communication costs of database joins in a distributed setting. However, the full potent...
Loizos Michael, Wolfgang Nejdl, Odysseas Papapetro...