32 search results - page 1 / 7 » False Negative Problem of Counting Bloom Filter |
TKDE
2010
13 years 3 months ago
2010
—Bloom filter is effective, space-efficient data structure for concisely representing a data set and supporting approximate membership queries. Traditionally, researchers often b...
ICPP
2006
IEEE
13 years 11 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...
JCST
2008
13 years 4 months ago
2008
Detecting duplicates in data streams is an important problem that has a wide range of applications. In general, precisely detecting duplicates in an unbounded data stream is not fe...
ESA
2006
Springer
13 years 8 months ago
2006
Springer
A counting Bloom filter (CBF) generalizes a Bloom filter data structure so as to allow membership queries on a set that can be changing dynamically via insertions and deletions. As...