Sciweavers

77 search results - page 2 / 16
» A new analysis of the false positive rate of a Bloom filter
Sort
View
IPCCC
2007
IEEE
14 years 1 months ago
A Power Management Proxy with a New Best-of-N Bloom Filter Design to Reduce False Positives
Miguel Jimeno, Kenneth J. Christensen, Allen Rogin...
TON
2002
175views more  TON 2002»
13 years 7 months ago
Compressed bloom filters
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, f...
Michael Mitzenmacher
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
DPD
2010
153views more  DPD 2010»
13 years 4 months ago
Cardinality estimation and dynamic length adaptation for Bloom filters
Abstract Bloom filters are extensively used in distributed applications, especially in distributed databases and distributed information systems, to reduce network requirements and...
Odysseas Papapetrou, Wolf Siberski, Wolfgang Nejdl
TKDE
2010
148views more  TKDE 2010»
13 years 5 months ago
False Negative Problem of Counting Bloom Filter
—Bloom filter is effective, space-efficient data structure for concisely representing a data set and supporting approximate membership queries. Traditionally, researchers often b...
Deke Guo, Yunhao Liu, Xiang-Yang Li, Panlong Yang