Finding hierarchical heavy hitters in data stream

Proceedings - 29th International Conference on Very Large Data Bases, VLDB 2003

Volumn , Issue , 2003, Pages 464-475

  Cormode, Graham ^a   Korn, Flip ^b   Muthukrishnan, S ^b   Srivastava, Divesh ^b  

^a RUTGERS UNIVERSITY   (United States)

^b ATandT Labs Reserch   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA COMMUNICATION SYSTEMS; DECISION SUPPORT SYSTEMS; TELECOMMUNICATION TRAFFIC;

DATA STREAM; DECISION SUPPORTS; HIERARCHICAL DATA; HIERARCHICAL HEAVY HITTERS; ON-LINE APPLICATIONS; ONLINE AGGREGATIONS; RANDOMIZED ALGORITHMS; STREAM DATA;

DENIAL-OF-SERVICE ATTACK;

EID: 85012186650     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. K. Beyer and R. Ramakrishnan. Bottom-up computation of sparse and iceberg CUBE. In Proceedings of the ACM SIGMOD International Conference n Management of Data, pages 359-370, 1999.
2. A. L. Buchsbaum, G. S. Fowler, B. Krishnamurthy, K. P. Vo, and J. Wang. Fast prefix matching of bounded strings. In Prceeding of SIAM ALENEX, 2003.
3. M. Charikar, K. Chen, and M. Farach-Colton. Finding frequent items in data streams. In Pr cedings of the International Colloqui on Automata, Languages and Programming ICALP), pages 693-703, 2002.
4. G. Cormode and S. Muthukrishnan. What's hot and what's not: tracking most frequent items dynamically. In Proceeding of ACM Princile of Datae System, 2003.
5. C. D. Cranor, Y. Gao, T. Johnson, V. Shkapenyuk, and O. Spatscheck. Gigas cope: high performance network monitoring with an SQL interface. In SIGMOD Conference 2002 page 623, 2002.
6. E. Demaine, A. Lopez-Ortiz, and J. I. Munro. Fre quency estimation of internet packet streams with limited space. In Prceeding of the 10th Annual European Smpsium n Algorithms, volume 2461 of Lecture Nte in Cmputer Science, pages 348-360, 2002.
7. C. Estan and G. Varghese. New directions in traf fic measurement and accounting. In Proceeding of ACM SIGCOMM, pages 323-336, 2002.
8. M. Fang, N. Shivakumar, H. Garcia-Molina, R. Motwani, and J. D. Ullman. Computing ice berg queries efficiently. In Prceeding of the Twent-fourth International Conference on Very Large Databases, pages 299-310, 1998.
9. A. Feldmann, A. G. Greenberg, C. Lund, N. Reingold, J. Rexford, and F. True. Deriving traffic demands for operational IP networks: methodol ogy and experience. In Proceeding of ACM SIG COMM, pages 257-270, 2000.
10. T. M. Gil and M. Poletto. MULTOPS: a datastructure for bandwidth attack detection. In 10th USENIX Secrity Symposium, pages 23-38, 2001.
11. A. Gilbert, Y. Kotidis, S. Muthukrishnan, and M. Strauss. QuickSAND: quick summary and analysis of network data. Technical Report 2001 43, DIMACS, 2001.
12. A. Gilbert, Y. Kotidis, S. Muthukrishnan, and M. Strauss. Surfing wavelets on streams: one-pass summaries for approximate aggregate queries In International Conference on Ver Large ata (VLDB), pages 79-88, 2001.
13. A. C. Gilbert, Y. Kotidis, S. Muthukrishnan, and M. Strauss. How to summarize the universe: dynamic maintenance of quantiles. In Proceedings of 28th International Conference n Ver Large ata Bases, pages 454-465, 2002.
14. M. Greenwald and S. Khanna. Space-efficient online computation of quantile summaries. In Prceeding of the ACM SIGMOD International Conference n Management of Data, pages 58-66, 2001.
15. S. Guha, N. Koudas, and K. Shim. Data streams and histograms. In ACM Symposium on The of Cmputing (STOC), pages 471-475, 2001.
16. R. Karp, C. Papadimitriou, and S. Shenker. A simple algorithm for finding frequent elements in sets and bags. ACM Tranacti Datab System, 28:51-55, 2003.
17. J. Kleinberg. Bursty and hierarchical structure in streams. In Proceedings of the 8th ACM SIGKDD Internatinal Conference o nowledge Dcov er and ata Mining, 2001.
18. B. Krishnamurthy and J. Wang. On networkaware clustering of web clients. In Proceedings of the ACM SIGCOMM Cference, pages 97-110, 2000.
19. L. V. S. Lakshmanan, R. T. Ng, C. X. Wang, X. Zhou, and T. Johnson. The generalized MDL approach for summarization. In International Conference on Very Large Data (VLDB), pages 766-777, 2002.
20. L. V. S. Lakshmanan, J. Pei, and J. Han. Quotient cube: how to summarize the semantics of a data cube. In International Conference on Ver Large Datab (VLDB), pages 778-789, 2002.
21. R. Mahajan, S. M. Bellovin, S. Loyd, J. Ioanni Dis, V. Paxson, and S. Shenker. Controlling high bandwidth aggregates in the network. Computer Cmmnicatis Review, 32(3):62-73, 2002.
22. G. Manku and R. Motwani. Approximate fre quency counts over data streams. In International Conference on Very Large Data (VLDB), pages 346-357, 2002.
23. G. S. Manku, S. Rajagopalan, and B. G. Lindsay. Approximate medians and other quantiles in one pass and with limited memory. In Proceedings ACM SIGMOD International Conference Management of Data, pages 426-435, 1998.
24. G. S. Manku, S. Rajagopalan, and B. G. Lindsay. Random sampling techniques for space ef ficient online computation of order statistics of large datasets. In Proceedings ACM SIGMOD International Conference on Management of Data, pages 251-262, 1999.
25. J. I. Munro and M. S. Paterson. Selection and sorting with limited storage. Theretical Cmputer Science, pages 315-323, 1980.
26. S. Muthukrishnan. Data streams: algorithms and applications. In ACM-SIAM Symposium on Discrete Alrithms http://athosrutgersedu/~muthu/stream-ps 2003.
27. Cisco Netflow. http://www.ciscocom/warp/public/-732/netflow/