A simpler and more efficient deterministic scheme for finding frequent items over sliding windows

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2006, Pages 290-297

  Lee, L K ^a   Ting, H F ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Data mining; Frequent items; Network monitoring; Streaming algorithms

Indexed keywords

ALGORITHMS; COMPUTER OPERATING SYSTEMS; DATA REDUCTION; DATA STRUCTURES; DISTRIBUTED COMPUTER SYSTEMS;

FREQUENT ITEMS; NETWORK MONITORING; STREAMING ALGORITHMS;

IDENTIFICATION (CONTROL SYSTEMS);

EID: 34250676594     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1142351.1142393     Document Type: Conference Paper

References (18)

1. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. Journal of Computer and System Sciences, 58:137-147, 1999.
2. A. Arasu and G. Manku. Approximate counts and quantiles over sliding windows. In Proceedings of the 23rd ACM Symposium on Principles of Database Systems, pages 286-296, 2004.
3. M. Charikar, K. Chen, and M. Farach-Colton. Finding frequent items in data streams. In Proceedings of the 29th International Colloquium on Automata, Languages, and Programming, pages 693-703, 2002.
4. G. Cormode and S. Muthukrishnan. What's hot and what's not: Tracking most frequent items dynamically. In Proceedings of the ACM Symposium on Principles of Database Systems, pages 296-306, 2003.
5. M. Datar, A. Gionis, P. Indyk, and R. Motwani. Maintaining stream statistics over sliding windows. SIAM Journal on Computing, 31(6):1794-1813, 2002.
6. E. D. Demaine, A. López-Ortiz, and J. I. Munro. Frequency estimation of internet packet streams with limited space. In Proceeding of the 10th Annual European Symposium on Algorithms, pages 348-360, 2002.
7. C. Estan and G. Varghese. New directions in traffic measurement and accounting: focusing on the elephants, ignoring the mice. ACM Transactions on Computer System, 21(3):270-313, 2003.
8. P. B. Gibbons and Y. Matias. New sampling-based summary statistics for improving approximate query answers. In Proceedings of the A CM SIGMOD International Conference on Management of Data, pages 331-342, 1998.
9. A. C. Gilbert, Y. Kotidis, and M. J. Strauss. Surfing wavelets on streams: One-pass summaries for approximate aggregate queries. In Proceedings of the 27th International Conference on Very Large Data Bases, pages 79-88, 2001.
10. L. Golab, D. DeHaan, E. D. Demaine, A. López-Ortiz, and J. I. Munro. Identifying frequent items in sliding windows over on-line packet streams. In Proceedings of the Internet Measurement Conference, pages 173-178, 2003.
11. L. Golab, D. DeHaan, A. López-Ortiz, and E. D. Demaine. Finding frequent items in sliding windows with multinomially-distributed item frequencies. In Proceedings of the 16th International Conference on Scientific and Statistical Database Management, pages 425-426, 2004.
12. S. Guha, N. Koudas, and K. Shim. Data-streams and histograms. In Proceedings of the 33rd ACM Symposium on Theory of Computing, pages 471-475, 2001.
13. S. Guha, N. Mishra, R. Motwani, and L. O'Callaghan. Clustering data streams. In Proceedings of the 41st IEEE Symposium on Foundations of Computer Science, pages 359-366, 2000.
14. C. Jin, W. Qian, C. Sha, J. X. Yu, and A. Zhou. Dynamically maintaining frequent items over a data stream. In Proceedings of the 12th ACM International Conference on Information and Knowledge Management, pages 287-294, 2003.
15. R. M. Karp, S. Shenker, and C. H. Papadimitriou. A simple algorithm for finding frequent elements in streams and bags. ACM Transactions on Database Systems, 28:51-55, 2003.
16. L. K. Lee and H. F. Ting. Maintaining significant stream statistics over sliding windows. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 724-732, 2006.
17. A. Manjhi, V. Shkapenyuk, K. Dhamdhere, and C. Olston. Finding (recently) frequent items in distributed data streams. In Proceedings of the 21st International Conference on Data Engineering, pages 767-778, 2005.
18. J. Misra and D. Gries. Finding repeated elements. Science of Computer Programming, 2(2): 143-152, 1982.