Space-optimal heavy hitters with strong error bounds

ACM Transactions on Database Systems

Volumn 35, Issue 4, 2010, Pages

  Berinde, Radu ^a   Indyk, Piotr ^a   Cormode, Graham ^b   Strauss, Martin J ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b AT AND T LABS RESEARCH   (United States)

^c UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Frequency estimation; Heavy hitters; Streaming algorithms

Indexed keywords

DATA STREAM; ERROR BOUND; FREQUENCY VECTOR; HEAVY-HITTER; SPACE BOUNDS; SPARSE RECOVERY; STREAMING ALGORITHM;

ERROR ANALYSIS; FREQUENCY ESTIMATION; OPTIMIZATION; VECTOR SPACES;

APPROXIMATION ALGORITHMS;

EID: 78650668413     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/1862919.1862923     Document Type: Conference Paper

References (41)

1. ARASU, A., BABU, S., AND WIDOM, J. 2003. CQL: A language for continuous queries over streams and relations. In Proceedings of the 9th DBPL International Confenrence on Data Base and Programming Languages. 1-11.
2. BERINDE, R., CORMODE, G., INDYK, P., AND STRAUSS, M. 2009. Space-optimal heavy hitters with strong error bounds. Proceedings of the ACM Symposion on Principles of Database Systems.
3. BERINDE, R.,GILBERT, A., INDYK, P.,KARLOFF, H., AND STRAUSS, M. 2008a. Combining geometry and combinatorics: a unified approach to sparse signal recovery. In Proceedings of the Allerton Conference.
4. 1 norm. In Proceedings of the Allerton Conference.
5. BESTAVROS, A.,CROVELLA, M., AND TAQQU, T. 1999. Heavy-Tailed Probability Distributions in theWorld Wide Web. Birkhäuser, 3-25.
6. BEYER, K. AND RAMAKRISHNAN, R. 1999. Bottom-up computation of sparse and iceberg cubes. In Proceedings of the ACM SIGMOD International Conference on Management of Data. 359-370.
7. BONNET, P., GEHRKE, J., AND SESHADRI, P. 2001. Towards sensor database systems. In Proceedings of the 2nd IEEE MDM International Conference on Mobile Data Management. 3-14.
8. BOSE, P., KRANAKIS, E., MORIN, P., AND TANG, Y. 2003. Bounds for frequency estimation of packet streams. In Proceedings of the 10th International Colloquium on Structural Information and Communication Complexity. 33-42.
9. BRESLAU, L., CAO, P., FAN, L., PHILLIPS, G., AND SHENKER, S. 1999. Web caching and Zipf-like distributions: Evidence and implications. In Proceedings of the IEEE International Conference on Computer Communications (INFOCOM). 126-134.
10. CANDÈS, E. J., ROMBERG, J., AND TAO, T. 2006. Stable signal recovery from incomplete and inaccurate measurements. Comm. Pure Applied Math. 59, 8, 1208-1223.
11. CHAKRABARTI, A., CORMODE, G., AND MCGREGOR, A. 2007. A near-optimal algorithm for computing the entropy of a stream. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms.
12. CHARIKAR, M., CHEN, K., AND FARACH-COLTON, M. 2002. Finding frequent items in data streams. In Proceedings of the 29th ICALP International Colloqium on Automata, Languages and Programming. 693-703.
13. CORMODE, G.,GOLAB, L.,KORN, F.,MCGREGOR, A., SRIVASTAVA, D., AND ZHANG, X. 2009. Estimating the confidence of conditional functional dependencies. In Proceedings of the Conference on the Management of Data ACM-SIGMOD.
14. CORMODE, G. AND HADJIELEFTHERIOU, M. 2008. Finding frequent items in data streams. VLDB J. 1, 2, 1530-1541.
15. 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.
16. CORMODE, G. AND MUTHUKRISHNAN, S. 2005. An improved data stream summary: The count-min sketch and its applications. J. Algor. 55, 1, 58-75.
17. DEMAINE, E., ORTIZ, A. L., AND MUNRO, J. 2002. Frequency estimation of internet packet streams with limited space. In Proceedings of the 10th ESA Annual European Symposium on Algorithms. 348-360.
18. DONOHO, D. L. 2006. Compressed Sensing. IEEE Trans. Inform. Theory 52, 4, 1289-1306.
19. ESTAN, C. AND VARGHESE, G. 2001. New directions in traffic measurement and accounting. In Proceedings of the ACM SIGCOMM Internet Measurement Workshop.
20. FANG, M., SHIVAKUMAR, N., GARCIA-MOLINA, H., MOTWANI, R., AND ULLMAN, J. 1998. Computing iceberg queries efficiently. In Proceedings of the International Conference on Very Large Data Bases. 299-310.
21. FIMI Repository. 2008. Frequent itemset mining dataset repository, University of Helsinki. http://fimi.cs.helsinki.fi/data.
22. GANGULY, S. AND LAKSHMINATH, B. 2006. Estimating entropy over data streams. In Proceedings of the European Symposium on Algorithms (ESA).
23. GAROFALAKIS, M., GEHRKE, J., AND RASTOGI, R. 2002. Querying and mining data streams: You only get one look. In Proceedings of the Conference on the Management of Data ACM-SIGMOD.
24. GILBERT, A. C., STRAUSS, M. J., TROPP, J. A., AND VERSHYNIN, R. 2007. One sketch for all: fast algorithms for compressed sensing. In Proceedings of the ACM Symposium on Theory of Computing. 237-246.
25. HAN, J., PEI, J., DONG, G., AND WANG, K. 2001. Efficient computation of iceberg cubes with complex measures. In Proceedings of the ACM SIGMOD International Conference on Management of Data. 1-12.
26. HERSHBERGER, J., SHRIVASTAVA, N., SURI, S., AND TÓTH, C. D. 2005. Space complexity of hierarchical heavy hitters in multi-dimensional streams. In Proceedings of the Principles of Database Systems. 338-347.
27. INDYK, P. 2004. Algorithms for dynamic geometric problems over data streams. In Proceedings of the ACM Symposium on Theory of Computing.
28. INDYK, P. 2007. Sketching, streaming and sublinear-space algorithms. Graduate course notes. http://stellar.mit.edu/S/course/6/fa07/6.895/.
29. 1 norm. In Proceedings of the IEEE Conference on Foundations of Computer Science.
30. KARP, R. M., SHENKER, S., AND PAPADIMITRIOU, C. H. 2003. A simple algorithm for finding frequent elements in streams and bags. ACM Trans. Datab. Syst. 28, 1, 51-55.
31. KOHAVI, R., BRODLEY, C., FRASCA, B., MASON, L., AND ZHENG, Z. 2000. KDD-Cup 2000 organizers' report: Peeling the onion. SIGKDD Explor. 2, 2, 86-98.
32. LUCCHESE, C., ORLANDO, S., PEREGO, R., AND SILVESTRI, F. 2004. Webdocs: a real-life huge transactional dataset. In Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI).
33. MANERIKAR, N. AND PALPANAS, T. 2009. Frequent items in streaming data: An experimental evaluation of the state-of-the-art. Data Knowl. Eng. 68, 4.
34. 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.
35. METWALLY, A., AGRAWAL, D., AND ABBABI, A. 2005. Efficient computation of frequent and top-k elements in data streams. In Proceedings of the International Conference on Database Theory. 398-412.
36. MISRA, J. AND GRIES, D. 1982. Finding repeated elements. Sci. Comput. Prog. 2, 142-152.
37. MUTHUKRISHNAN, S. 2005. Data streams: Algorithms and applications. Foundations and Trends in Theoretical Computer Science.
38. REDNER, S. 1998. How popular is your paper? An empirical study of the citation distribution. European Physical J. B, 131-134.
39. Rice DSP Group. Compressed sensing resources. http://www.dsp.ece.rice. edu/cs.
40. SHRIVASTAVA, N., BURAGOHAIN, C., AGRAWAL, D., AND SURI, S. 2004. Medians and beyond: new aggregation techniques for sensor networks. In Proceedings of the 2nd International Conference on Embedded Network Sensor Systems. 239-249.
41. ZIPF, G. 1949. Human Behavior and The Principle of Least Effort. Addison-Wesley.