Space complexity of hierarchical heavy hitters in multi-dimensional data streams

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

Volumn , Issue , 2005, Pages 338-347

  Hershberger, John ^a   Shrivastava, Nisheeth ^b   Suri, Subhash ^b   Tóth, Csaba D ^c  

^a MENTOR GRAPHICS CORPORATION   (United States)

^b University of California   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STREAM ALGORITHMS; DISCOUNTED FREQUENCIES; HIERARCHIAL HEAVY HITTERS (HHH);

ALGORITHMS; APPROXIMATION THEORY; COMPUTATION THEORY; DATA WAREHOUSES;

DATA REDUCTION;

EID: 33244487239     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1065167.1065211     Document Type: Conference Paper

References (13)

1. N. Alon, Y. Matias, M. Szegedy. The space complexity of approximating the frequency moments. J. Comput. Syst. Sci. 58 (1999), 137-147.
2. A. Arasu and G. Manku. Approximate counts and quantiles over sliding windows. In Proc. 23rd PODS, 2004, ACM Press, pp. 286-296.
3. B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom. Models and issues in data stream systems. In 21st PODS, 2002, ACM Press, pp. 1-16.
4. M. Charikar, K. Chen, and M. Farach-Colton. Finding frequent items in data streams. In 29th Proc. ICALP, LNCS, Springer-Verlag, 2002, pp. 693-703.
5. G. Cormode, F. Korn, S. Muthukrishnan, and D. Srivastava. Finding hierarchical heavy hitters in data streams. In Proc. 29th Conf. on Very Large Data Bases, 2003.
6. G. Cormode, F. Korn, S. Muthukrishnan, and D. Srivastava. Diamond in the rough: Finding hierarchical heavy hitters in multi-dimensional data, in Proc. ACM SIGMOD, 2004.
7. E. D. Demaine, A. López-Ortiz, and J. I. Munro. Frequency estimation of internet packet streams with limited space. In Proc. 10th European Sympos. Algorithms, LNCS 2461, 2002, pp. 348-360.
8. C. Estan, S. Savage, and G. Varghese. Automatically inferring patterns of resource consumption in network traffic. In Proc. of ACM SIGCOMM, 2003.
9. C. Estan and G. Varghese. New directions in traffic measurement and accounting. In Proc. 1st ACM SIGCOMM Workshop on Internet Measurement, 2001, pp. 75-80.
10. 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 (1) (2003), 51-55.
11. G. Manku and R. Motwani. Approximate frequency counts over data streams. In Proc. 28th Conf. Very Large Data Bases, 2002, pp. 346-357.
12. J. Misra and D. Gries. Finding repeated elements. Sci. Comput. Programming 2 (1982), 143-152.
13. S. Muthukrishnan. Data streams: Algorithms and applications. Preprint, 2003.