What's hot and what's not: Tracking most frequent items dynamically

ACM Transactions on Database Systems

Volumn 30, Issue 1, 2005, Pages 249-278

  Cormode, Graham ^a,b   Muthukrishnan, S ^a,c  

^a RUTGERS UNIVERSITY   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

Approximate query answering; Data stream processing

Indexed keywords

APPROXIMATE QUERY ANSWERING; DATA STREAM PROCESSING; TRANSACTIONS;

ALGORITHMS; DATA STRUCTURES; PROBABILITY; PROBLEM SOLVING; STATISTICAL METHODS;

DATABASE SYSTEMS;

EID: 23944436942     PISSN: 03625915     EISSN: None     Source Type: Journal    
DOI: 10.1145/1061318.1061325     Document Type: Review

References (34)

1. AHO, A. V., HOPCROFT, J. E., AND ULLMAN, J. D. 1987. Data structures and algorithms. Addison-Wesley, Reading, MA.
2. ALON, N., GIBBONS, P., MATIAS, Y., AND SZEGEDY, M. 1999. Tracking join and self-join sizes in limited storage. In Proceedings of the Eighteenth ACM Symposium on Principles of Database Systems. 10-20.
3. ALON, N., MATIAS, Y., AND SZEGEDY, M. 1996. The space complexity of approximating the frequency moments. In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing. 20-29.
4. Journal version in J. Comput. Syst. Sci., 58, 137-147, 1999.
5. BABCOCK, B. AND OLSTON, C. 2003. Distributed top-k monitoring. In Proceedings of ACM SIGMOD International Conference on Management of Data.
6. BARBARA, D., WU, N., AND JAJODIA, S. 2001. Detecting novel network intrusions using Bayes estimators. In Proceedings of the First SIAM International Conference on Data Mining.
7. BOYER, B. AND MOORE, J. 1982. A fast majority vote algorithm. Tech. Rep. 35. Institute for Computer Science, University of Texas, at Austin, Austin, TX.
8. CARTER, J. L. AND WEGMAN, M. N. 1979. Universal classes of hash functions. J. Comput. Syst. Sci. 18, 2, 143-154.
9. 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.
10. CORMODE, G. AND MUTHUKRISHNAN, S. 2003. What's hot and what's not: Tracking most frequent items dynamically. In Proceedings of ACM Conference on Principles of Database Systems. 296-306.
11. CORMODE, G. AND MUTHUKRISHNAN, S. 2004a. An improved data stream summary: The count-min sketch and its applications. J. Algorithms. In press.
12. CORMODE, G. AND MUTHUKRISHNAN, S. 2004b. What's new: Finding significant differences in network data streams. In Proceedings of IEEE Infocom.
13. DEMAINE, E., LÓPEZ-ORTIZ, A., AND MUNRO, J. I. 2002. Frequency estimation of Internet packet streams with limited space. In Proceedings of the 10th Annual European Symposium on Algorithms. Lecture Notes in Computer Science, vol. 2461. Springer, Berlin, Germany, 348-360.
14. DU, D.-Z. AND HWANG, F. 1993. Combinatorial Group Testing and Its Applications. Series on Applied Mathematics, vol. 3. World Scientific, Singapore.
15. ESTAN, C. AND VARGHESE, G. 2002. New directions in traffic measurement and accounting. In Proceedings of ACM SIGCOMM. Journal version in Comput. Commun. Rev. 32, 4, 323-338.
16. FANG, M., SHIVAKUMAR, N., GARCIA-MOLINA, H., MOTWANI, R., AND ULLMAN, J. D. 1998. Computing iceberg queries efficiently. In Proceedings of the International Conference on Very Large Data Bases. 299-310.
17. FISCHER, M. AND SALZBERG, S. 1982. Finding a majority among n votes: Solution to problem 81-5. J. Algorith. 3, 4, 376-379.
18. GAROFALAKIS, M., GEHRKE, J., AND RASTOGI, R. 2002. Querying and mining data streams: You only get one look. In Proceedings of the ACM SIGMOD International Conference on Management of Data.
19. GIBBONS, P. AND MATIAS, Y. 1998. New sampling-based summary statistics for improving approximate query answers. In Proceedings of the ACM SIGMOD International Conference on Management of Data, Journal version in ACM SIGMOD Rec. 27, 331-342.
20. GIBBONS, P. AND MATIAS, Y. 1999. Synopsis structures for massive data sets. DIMACS Series in Discrete Mathematics and Theoretical Computer Science A.
21. GIBBONS, P. B., MATIAS, Y., AND POOSALA, V. 1997. Fast incremental maintenance of approximate histograms. In Proceedings of the International Conference on Very Large Data Bases. 466-475.
22. GILBERT, A., GUHA, S., INDYK, P., KOTIDIS, Y., MUTHUKRISHNAN, S., AND STRAUSS, M. 2002a. Fast, small-space algorithms for approximate histogram maintenance. In Proceedings of the 34th ACM Symposium on the Theory of Computing. 389-398.
23. GILBERT, A., KOTIDIS, Y., MUTHUKRISHNAN, S., AND STRAUSS, M. 2001. QuickSAND: Quick summary and analysis of network data. DIMACS Tech. Rep. 2001-43, Available online at http://dimacs.crutgers.edu/Techniclts.
24. GILBERT, A. C., KOTIDIS, Y., MUTHUKRISHNAN, S., AND STRAUSS, M. 2002b. How to summarize the universe: Dynamic maintenance of quantiles. In Proceedings of the International Conference on Very Large Data Bases. 454-465.
25. IOANNIDIS, Y. E. AND CHRISTODOULAKIS, S. 1993. Optimal histograms for limiting worst-case error propagation in the size of the join radius. ACM Trans. Database Syst. 18, 4, 709-748.
26. IOANNIDIS, Y. E. AND POOSALA, V. 1995. Balancing histogram optimality and practicality for query result size estimation. In Proceedings of the ACM SIGMOD International Conference on the Management of Data. 233-244.
27. 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.
28. KUSHILEVITZ, E. AND NISAN, N. 1997. Communication Complexity. Cambridge University Press, Cambridge, U.K.
29. 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.
30. MISRA, J. AND GRIES, D. 1982. Finding repeated elements. Sci. Comput. Programm. 2, 143-152.
31. MOTWANI, R. AND RAGHAVAN, P. 1995. Randomized Algorithms. Cambridge University Press, Cambridge, U.K.
32. MUTHUKRISHNAN, S. 2003. Data streams: Algorithms and applications. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms. Available online at http://athos.rutgers.edu/~muthu/stream-1-1.ps.
33. THORUP, M. 2000. Even strongly universal hashing is pretty fast. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms. 496-497.
34. YI, B.-K., SIDIROPOULOS, N., JOHNSON, T., JAGADISH, H., FALOUTSOS, C., AND BILIRIS, A. 2000. Online data mining for co-evolving time sequences. In Proceedings of the 16th International Conference on Data Engineering (ICDE' 00). 13-22.