Finding hierarchical heavy hitters in streaming data

ACM Transactions on Knowledge Discovery from Data

Volumn 1, Issue 4, 2008, Pages

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

^a AT AND T LABS RESEARCH   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c AT AND T LABS RESEARCH   (United States)

^d RUTGERS UNIVERSITY   (United States)

Author keywords

Approximation algorithms; Data mining; Network data analysis

Indexed keywords

HIERARCHICAL HEAVY HITTERS (HHH); NETWORK DATA ANALYSIS;

APPROXIMATION ALGORITHMS; COMPUTATION THEORY; DATA MINING; DATA REDUCTION; DATA STRUCTURES;

COMPUTER NETWORKS;

EID: 39149089260     PISSN: 15564681     EISSN: 1556472X     Source Type: Journal    
DOI: 10.1145/1324172.1324174     Document Type: Article

References (26)

1. AGARWAL, S., AGRAWAL, R., DESHPANDE, P., GUPTA, A., NAUGHTON, J. F., RAMAKRISHNAN, R., AND SARAWAGI, S. 1996. On the computation of multidimensional aggregates. In Proceedings of the International Conference on Very Large Data Bases.
2. BEYER, K. AND RAMAKRISHNAN, R. 1999. Bottom-Up computation of sparse and Iceberg CUBE. In Proceedings of the ACM SIGMOD International Conference on Management of Data. Also in SIGMOD Rec. 28, 2, 359-370.
3. CHARIKAR, M., CHEN, K., AND FARACH-COLTON, M. 2002. Finding frequent items in data streams. In Procedings of the International Colloquium on Automata, Languages and Programming (ICALP), 693-703.
4. CORMODE, G., KORN, F., MUTHUKRISHNAN, S., JOHNSON, T., SPATSCHECK, O., AND SRIVASTAVA, D. 2004. Holistic UDAFs at streaming speeds. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 35-46.
5. CORMODE, G., KORN, F., MUTHUKRISHNAN, S., AND SRIVASTAVA, D. 2003. Finding hierarchical heavy hitters in data streams. In Proceedings of the International Conference on Very Large Data Bases, 464-475.
6. CORMODE, G., KORN, F., MUTHUKRISHNAN, S., AND SRIVASTAVA, D. 2004. Diamond in the rough: Finding hierarchical heavy hitters in multi-dimensional data. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 155-166.
7. CORMODE, G. AND MUTHUKRISHNAN, S. 2003. What's hot and what's not: Tracking most frequent items dynamically. In Proceedings of the ACM Conference on Principles of Database Systems, 296-306.
8. CORMODE, G. AND MUTHUKRISHNAN, S. 2005. An improved data stream summary: The count-min sketch and its applications. J. Algor. 55, 1, 58-75.
9. CRANOR, C., JOHNSON, T., SPATSCHECK, O., AND SHKAPENYUK, V. 2003. Gigascope: A stream database for network applications. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 647-651.
10. DEMAINE, E., LÓPEZ-ORTIZ, A., AND MUNRO, J. I. 2002. Frequency estimation of internet packet streams with limited space. In Proceedings of the European Symposium on Algorithms (ESA). Lecture Notes in Computer Science, vol. 2461. Springer, Berlin, 348-360.
11. ESTAN, C., SAVAGE, S., AND VARGHESE, G. 2003. Automatically inferring patterns of resource consumption in network traffic. In Proceedings of the ACM SIGCOMM Data Communications Festival.
12. GANESAN, P., GARCIA-MOLINA, H., AND WIDOM, J. 2003. Exploiting hierarchical domain structure to compute similarity. ACM Trans. Inf. Syst. 21, 1, 64-93.
13. GILBERT, A. C., KOTIDIS, Y., MUTHUKRISHNAN, S., AND STRAUSS, M. 2002. How to summarize the universe: Dynamic maintenance of quantiles. In Proceedings of the International Conference on Very Large Data Bases, 454-465.
14. GUHA, S., KOUDAS, N., AND SHIM, K. 2001. Data streams and histograms. In Proceedings of the ACM Symposium on Theory of Computing, 471-475.
15. HERSHBERGER, J., SHRIVASTAVA, N., SURI, S., AND TOTH, C. 2005. Space complexity of hierarchical heavy hitters in multi-dimensional data streams. In Proceedings of the ACM Conferences Principles of Database Systems.
16. KARP, R., PAPADIMITRIOU, C., AND SHENKER, S. 2003. A simple algorithm for finding frequent elements in sets and bags. ACM Trans. Database Syst. 28, 51-55.
17. LAKSHMANAN, L. V. S., NG, R. T., WANG, C. X., ZHOU, X., AND JOHNSON, T. 2002. The generalized MDL approach for summarization. In Proceedings of the International Conference on Very Large Data Bases, 766-777.
18. LEE, J., KIM, D., AND CHUNG, C. 1999. Multidimensional selectivity estimation using compressed histogram information. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 205-214.
19. MANJHI, A., SHKAPENYUK, V., DHAMDHERE, K., AND OLSTON, C. 2005. Finding (recently) frequent items in distributed data streams. In Proceedings of the IEEE International Conference on Data Engineering, 767-778.
20. MANKU, G. AND MOTWANI, R. 2002. Approximate frequency counts over data streams. In Proceedings of the International Conference on Very Large Data Bases, 346-357.
21. METWALLY, A., AGRAWAL, D., AND ABBADI, A. E. 2005. Efficient computation of frequent and top-k elements in data streams. In Proceedings of the International Conference on Database Theory.
22. MISRA, J. AND GRIES, D. 1982. Finding repeated elements. Sci. Comput. Program. 2, 143-152.
23. NG, R. T., WAGNER, A. S., AND YIN, Y. 2001. Iceberg-Cube computation with PC clusters. In Proceedings of the ACM SIGMOD International Conference on Management of Data.
24. THAPER, N., INDYK, P., GUHA, S., AND KOUDAS, N. 2002. Dynamic multidimensional histograms. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 359-366.
25. VITTER, J. S., WANG, M., AND IYER, B. 1998. Data cube approximation and histograms via wavelets. In Proceedings of the 7th ACM International. Conference on Information and, Knowledge Management. 96-104.
26. ZHANG, Y., SINGH, S., SEN, S., DUFFIELD, N., AND LUND, C. 2004. Online identification of hieararchical heavy hitters: Algorithms, evaluation and applications. In Proceedings of the Internet Measurement Conference (IMC).