Frequency estimation over sliding windows

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2008, Pages 1385-1387

  Zhang, Linfeng ^a   Guan, Yong ^a  

^a Iowa State University of Science and Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA ENGINEERING; DATA STREAM PROCESSING; DATA STREAMING; EFFICIENT ALGORITHMS; INTERNATIONAL CONFERENCES; LARGE DATA; ONE-PASS; RUNNING TIME; SLIDING WINDOWS; SPACE AND TIME;

DATA MINING; DECODING; ESTIMATION; FREQUENCY ESTIMATION; RIVERS; TECHNOLOGY; WINDOWS;

DATA PROCESSING;

EID: 52649173156     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2008.4497564     Document Type: Conference Paper

References (25)

1. B. Babcock, S. Babu, M. Datar, R. Motwani, and J, Widom, "Models and issues in data stream systems," in PODS 2002.
2. S. Muthukrishnan, "Data streams: Algorithms and applications," Rutgers University, Piscataway, USA, Tech. Rep., 2003.
3. M. Fang, N. Shivakumar, H. Garcia-Molina, R. Motwani, and J. D. Ullman, "Computing iceberg queries efficiently," in VLDB 1998.
4. A. Arasu and G. S. Manku, "Approximate counts and quantiles over sliding windows," in PODS 2004.
5. B. Babcock, M. Datar, R. Motwani, and L. O'Callaghan, "Maintaining variance and k-medians over data stream windows," in PODS 2003.
6. M. Datar, A. Gionis, P. Indyk, and R. Motwani, "Maintaining stream statistics over sliding windows," in SODA 2002.
7. J. Feigenbaum, S. Kannan, and J. Zhang, "Computing diameter in the streaming and sliding-window models," Algorithmica, vol. 41, no. 1, pp. 25-41, 2004.
8. P. B. Gibbons and S. Tirthapura, "Distributed streams algorithms for sliding windows," in SPAA 2002.
9. X. Lin, H. Lu, J. Xu, and J. X. Yu, "Continuously maintaining quantile summaries of the most recent N elements over a data stream," in ICDE 2004.
10. S. Tirthapura, B. Xu, and C. Busch, "Sketching asynchronous streams over sliding windows," in PODC 2006.
11. L. Zhang and Y. Guan, "Variance estimation over sliding windows," in PODS 2007.
12. Y. Zhu and D. Shasha, "StatStream: Statistical monitoring of thousands of data streams in real time," in VLDB 2002.
13. L. Lee and H. Ting, "A simpler and more efficient deterministic scheme for finding frequent items over sliding windows," in PODS 2006.
14. P. Flajolet and G. N. Martin, "Probabilistic counting algorithms for data base applications," Journal of Computer and System Sciences, vol. 31, no. 2, pp. 182-209, 1985.
15. K.-Y. Whang, B. T. Vander-Zanden, and H. M. Taylor, "A linear-time probabilistic counting algorithm for database applications," TODS, vol. 15, no. 2, pp. 208-229, Jun. 1990.
16. N. Alon, Y. Matias, and M. Szegedy, "The space complexity of approximating the frequency moments," in STOC 1996.
17. P. B. Gibbons and Y. Matias, "New sampling-based summary statistics for improving approximate query answers," in SIGMOD 1998.
18. C. Estan and G. Varghese, "New directions in traffic measurement and accounting," in SIGCOMM 2002.
19. M. Charikar, K. Chen, and M. Farach-Colton, "Finding frequent items in data streams," in ICALP 2002.
20. G. S. Manku and R. Motwani, "Approximate frequency counts over data streams," in VLDB 2002.
21. G. Cormode and S. Muthukrishnan, "What's hot and what's not: Tracking most frequent items dynamically," in PODS 2003.
22. J. Misra and D. Giles, "Finding repeated elements," Science of Computer Programming, vol. 2, no. 2, pp. 143-152, Nov. 1982.
23. R. M. Karp, S. Shenker, and C. H. Papadimitriou, "A simple algorithm for finding frequent elements in streams and bags," TODS, vol. 28, no. 1, pp. 51-55, Mar. 2003.
24. E. D. Demaine, A. López-Ortiz, and J, I. Munro, "Frequency estimation of internet packet streams with limited space," in ESA 2002.
25. T. M. Chan and B. S. Sadjad, "Geometric optimization problems over sliding windows," in ISAAC 2004.