Finding Hierarchical Heavy Hitters in Data Streams

Proceedings 2003 VLDB Conference: 29th International Conference on Very Large Databases (VLDB)

Volumn , Issue , 2003, Pages 464-475

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

^a American Gastroenterological Association   (United States)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77953977211     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1016/B978-012722442-8/50048-3     Document Type: Chapter

References (27)

1. K. Beyer., R. Ramakrishnan Bottom-up computation of sparse and iceberg CUBE Proceedings of the ACM SIGMOD International Conference on Management of Data 1999 359-370.
2. A.L. Buchsbaum., G.S. Fowler., B. Krishnamurthy., K.-P. Vo., J. Wang Fast prefix matching of bounded strings Proceedings of SIAM ALENEX 2003.
3. M. Charikar., K. Chen., M. Farach-Colton Finding frequent items in data streams Procedings of the International Colloquium on Automata, Languages and Programming (ICALP) 2002 693-703.
4. G. Cormode., S. Muthukrishnan What’s hot and what’s not: tracking most frequent items dynamically Proceedings of ACM Principles of Database Systems 2003.
5. C.D. Cranor., Y. Gao., T. Johnson., V. Shkapenyuk., O. Spatscheck Gigascope: high performance network monitoring with an SQL interface SIGMOD Conference 2002 2002 623.
6. E. Demaine., A. López-Ortiz., J.I. Munro Frequency estimation of internet packet streams with limited space Proceedings of the 10th Annual European Symposium on Algorithms, volume 2461 of Lecture Notes in Computer Science 2002 348-360.
7. C. Estan., G. Varghese New directions in traffic measurement and accounting Proceedings of ACM SIGCOMM 2002 323-336.
8. M. Fang., N. Shivakumar., H. Garcia-Molina., R. Motwani., J.D. Ullman Computing iceberg queries efficiently Proceedings of the Twenty-fourth International Conference on Very Large Databases 1998 299-310.
9. A. Feldmann., A.G. Greenberg., C. Lund., N. Reingold., J. Rexford., F. True Deriving traffic demands for operational IP networks: methodology and experience Proceedings of ACM SIGCOMM 2000 257-270.
10. T.M. Gil., M. Poletto MULTOPS: a data-structure for bandwidth attack detection 10th USENIX Security Symposium 2001 23-38.
11. A. Gilbert., Y. Kotidis., S. Muthukrishnan., M. Strauss QuickSAND: quick summary and analysis of network data Technical Report 2001-43, DIMACS 2001.
12. A. Gilbert., Y. Kotidis., S. Muthukrishnan., M. Strauss Surfing wavelets on streams: one-pass summaries for approximate aggregate queries International Conference on Very Large Databases (VLDB) 2001 79-88.
13. A.C. Gilbert., Y. Kotidis., S. Muthukrishnan., M. Strauss How to summarize the universe: dynamic maintenance of quantiles Proceedings of 28th International Conference on Very Large Data Bases 2002 454-465.
14. M. Greenwald., S. Khanna Space-efficient online computation of quantile summaries Proceedings of the ACM SIGMOD International Conference on Management of Data 2001 58-66.
15. S. Guha., N. Koudas., K. Shim Data streams and histograms ACM Symposium on Theory of Computing (STOC) 2001 471-475.
16. R. Karp., C. Papadimitriou., S. Shenker A simple algorithm for finding frequent elements in sets and bags ACM Transactions on Database Systems 28 2003 51-55.
17. J. Kleinberg Bursty and hierarchical structure in streams Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 2001.
18. B. Krishnamurthy., J. Wang On network-aware clustering of web clients Proceedings of the ACM SIGCOMM Conference 2000 97-110.
19. L.V.S. Lakshmanan., R.T. Ng., C.X. Wang., X. Zhou., T. Johnson The generalized MDL approach for summarization International Conference on Very Large Databases (VLDB) 2002 766-777.
20. L.V.S. Lakshmanan., J. Pei., J. Han Quotient cube: how to summarize the semantics of a data cube International Conference on Very Large Databases (VLDB) 2002 778-789.
21. R. Mahajan., S.M. Bellovin., S. Floyd., J. Ioannidis., V. Paxson., S. Shenker Controlling high bandwidth aggregates in the network Computer Communications Review 32 3 2002 62-73.
22. G. Manku., R. Motwani Approximate frequency counts over data streams International Conference on Very Large Databases (VLDB) 2002 346-357.
23. G.S. Manku., S. Rajagopalan., B.G. Lindsay Approximate medians and other quantiles in one pass and with limited memory Proceedings ACM SIGMOD International Conference on Management of Data 1998 426-435.
24. G.S. Manku., S. Rajagopalan., B.G. Lindsay Random sampling techniques for space efficient online computation of order statistics of large datasets Proceedings ACM SIGMOD International Conference on Management of Data 1999 251-262.
25. J.I. Munro., M.S. Paterson Selection and sorting with limited storage Theoretical Computer Science 1980 315-323.
26. http://athos.rutgers.edu/∼muthu/stream-1-1.ps S. Muthukrishnan Data streams: algorithms and applications ACMSIAM Symposium on Discrete Algorithms 2003.
27. http://www.cisco.com/warp/public/732/netflow/.