Finding Frequent Items in SlidingWindows over Data Streams Using EBF

This paper introduces the algorithm FIS-EBF for estimating the frequent items in sliding windows over data streams. FIS-EBF is Based the data structure named EBF (extensible bloom filter). Experiments show that FIS-EBF can work with high precision and recall, it is also showed that FIS-EBF is very efficient in terms of processing time.

[1]  Erik D. Demaine,et al.  Identifying frequent items in sliding windows over on-line packet streams , 2003, IMC '03.

[2]  Miska M. Hannuksela,et al.  H.264/AVC in wireless environments , 2003, IEEE Trans. Circuits Syst. Video Technol..

[3]  Divyakant Agrawal,et al.  Efficient Computation of Frequent and Top-k Elements in Data Streams , 2005, ICDT.

[4]  Xiulan Hao,et al.  Finding Frequent Items in Data Streams Using ESBF , 2007, PAKDD Workshops.

[5]  Graham Cormode,et al.  What's hot and what's not: tracking most frequent items dynamically , 2003, TODS.

[6]  Graham Cormode,et al.  What's hot and what's not: tracking most frequent items dynamically , 2003, PODS '03.

[7]  Erik D. Demaine,et al.  Frequency Estimation of Internet Packet Streams with Limited Space , 2002, ESA.

[8]  Lap-Pui Chau,et al.  A motion vector recovery algorithm for digital video using Lagrange interpolation , 2003, IEEE Trans. Broadcast..

[9]  Li Fan,et al.  Summary cache: a scalable wide-area web cache sharing protocol , 2000, TNET.

[10]  Gurmeet Singh Manku,et al.  Approximate counts and quantiles over sliding windows , 2004, PODS.

[11]  Burton H. Bloom,et al.  Space/time trade-offs in hash coding with allowable errors , 1970, CACM.

[12]  Moses Charikar,et al.  Finding frequent items in data streams , 2002, Theor. Comput. Sci..

[13]  Aggelos K. Katsaggelos,et al.  Error resilient video coding techniques , 2000, IEEE Signal Process. Mag..

[14]  Richard M. Karp,et al.  A simple algorithm for finding frequent elements in streams and bags , 2003, TODS.

[15]  Johannes Gehrke,et al.  Querying and mining data streams: you only get one look a tutorial , 2002, SIGMOD '02.

[16]  Kyriakos Mouratidis,et al.  Continuous monitoring of top-k queries over sliding windows , 2006, SIGMOD Conference.

[17]  Aoying Zhou,et al.  Dynamically maintaining frequent items over a data stream , 2003, CIKM '03.

[18]  Stephan Wenger,et al.  H.264/AVC over IP , 2003, IEEE Trans. Circuits Syst. Video Technol..

[19]  Josep-Lluís Larriba-Pey,et al.  Dynamic count filters , 2006, SGMD.

[20]  Hongjun Lu,et al.  False Positive or False Negative: Mining Frequent Itemsets from High Speed Transactional Data Streams , 2004, VLDB.

[21]  Yossi Matias,et al.  Spectral bloom filters , 2003, SIGMOD '03.

[22]  George Varghese,et al.  New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice , 2003, TOCS.

[23]  Ness B. Shroff,et al.  Error Concealment in Encoded Video Streams , 1998 .

[24]  Rajeev Motwani,et al.  Approximate Frequency Counts over Data Streams , 2012, VLDB.

[25]  Rajeev Motwani,et al.  Computing Iceberg Queries Efficiently , 1998, VLDB.

[26]  Lap-Kei Lee,et al.  A simpler and more efficient deterministic scheme for finding frequent items over sliding windows , 2006, PODS '06.

[27]  Erik D. Demaine,et al.  Finding frequent items in sliding windows with multinomially-distributed item frequencies , 2004, Proceedings. 16th International Conference on Scientific and Statistical Database Management, 2004..