Parallel Architectures, Algorithms and Programming, International Symposium on (2010)

Dalian, Liaoning China

Dec. 18, 2010 to Dec. 20, 2010

ISBN: 978-0-7695-4312-3

pp: 263-268

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PAAP.2010.16

ABSTRACT

A probabilistic data stream $S$ is defined as a sequence of uncertain tuples $,i=1...\infty$, with the semantics that element $t_i$ occurs in the stream with probability $p_i \in (0,1)$. Thus each distinct element $t$, which occurs in tuples of $S$, has an existential probability based on the tuples: $ \in S$. Existing duplicate detection methods for a traditional deterministic data stream can't maintain these existential probabilities for elements in $S$, which is important query information. In this paper, we present a novel data structure, Floating Counter Bloom Filter (FCBF), as an extension of CBF [1], which can maintain these existential probabilities effectively. Based on FCBF, we present an efficient algorithm to approximately detect duplicates for probabilistic data streams over sliding windows. Given a sliding window size $W$ and floating counter number $N$, for any $t$ which occurs in the past sliding window, our method outputs the accurate existential probability of $t$ with probability $1-(1/2)^{ln(2)*N/W}$. Our experimental results on the synthetic data verify the effectiveness of our approach.

INDEX TERMS

Counting Bloom Filter, Floating Counter Bloom Filter, False Positive, Duplicate Detection, Probabilistic Data Stream

CITATION

Hong Shen,
Xiujun Wang,
"Approximately Detecting Duplicates for Probabilistic Data Streams over Sliding Windows",

*Parallel Architectures, Algorithms and Programming, International Symposium on*, vol. 00, no. , pp. 263-268, 2010, doi:10.1109/PAAP.2010.16