Separator: Sifting Hierarchical Heavy Hitters accurately from data streams

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4632 LNAI, Issue , 2007, Pages 170-182

  Lin, Yuan ^a   Liu, Hongyan ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

Algorithms; Data stream mining; Hierarchical heavy hitters

Indexed keywords

ALGORITHMS; DATA STRUCTURES; PROBLEM SOLVING; DATA COMMUNICATION SYSTEMS; SEPARATORS; TELECOMMUNICATION TRAFFIC;

DATA STREAM MINING; HIERARCHICAL HEAVY HITTERS; COMPACT DATA STRUCTURE; DATA STREAM; ERROR BOUND; SPACE USAGE; TOPDOWN PROCESSING;

DATA MINING; ALGORITHMS;

EID: 38049076597     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73871-8_17     Document Type: Conference Paper

References (16)

1. Gaber, M.M., Zaslavsky, A., Krishnaswamy, S.: Mining Data Streams: A Review. SIGMOD Record. 2, 18-26 (2005)
2. Cormode, G., Korn, F., Muthukrishnan, S., Srivastava, D.: Finding Hierarchical Heavy Hitters in Data Streams. In: Proc. 29th ACM VLDB, pp. 464-475 (2003)
3. Estan, C., Varghese, G.: New Directions in Traffic Measurement and Accounting. In: Proc. 1st ACM SIGCOMM Workshop on Internet Measurement, pp. 75-80 (2001)
4. Metwally, A., Agrawal, D., Abbadi, A.E.: Efficient Computation of Frequent and Top-k Elements in Data Streams. In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol. 3363, pp. 398-412. Springer, Heidelberg (2004)
5. Charikar, M., Chen, K., Farach-Colton, M.: Finding Frequent Items in Data Streams. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 693-703. Springer, Heidelberg (2002)
6. Manku, G., Motwani, R.: Approximate Frequency Counts over Data Streams. In: Proc. 28th ACM VLDB, pp. 346-357 (2002)
7. Demaine, E.D., López-Ortiz, A., Munro, J.I.: Frequency Estimation of Internet Packet Streams with Limited Space. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 348-360. Springer, Heidelberg (2002)
8. Cormode, G., Muthukrishnan, S.: Whats Hot and What's Not: Tracking Most Frequent Items Dynamically. In: Proc. 22nd ACM PODS, pp. 296-306 (2003)
9. Cormode, G., Muthukrishnan, S.: An Improved Data Stream Summary: The Count-Min Sketch and Its Applications. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol. 2976, pp. 29-38. Springer, Heidelberg (2004)
10. Estan, C., Savage, S., Varghese, G.: Automatically Inferring Patterns of Resource Consumption in Network Traffic. Computer Communication Review. 4, 137-150 (2003)
11. Gibbons, P.B., Matias, Y.: Synopsis Data Structures for Massive Data Set. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 39-70 (1999)
12. Muthukrishnan, S.: Data Streams: Algorithms and Applications. In: ACM-SIAM Symp. Discrete Algorithms (2003), Available http://athos.rutgers.edu/rn uthu/stream-1-1.ps
13. Zhang, Y., Singh, S., Sen, S., Duffield, N., Lund, C.: Online Identification of Hierarchical Heavy Hitters: Algorithms, Evaluation, and Applications. In: Proc. IMC, pp. 101-114 (2004)
14. Hershberger, J., Shrivastava, N., Suri, S., Toth, C.D.: Space Complexity of Hierarchical Heavy Hitters in Multi-Dimensional Data Streams. In: Proc. 24th PODS, pp. 338-347 (2005)
15. Cormode, G., Muthukrishnan, S.: Summarizing and Mining Skewed Data Streams. In: Proc. 5th SDM (2005)
16. Knuth, D.E.: The Art of Programming. Addison-Wesley, London (1973)