Finding frequent items in data streams

Proceedings of the VLDB Endowment

Volumn 1, Issue 2, 2008, Pages 1530-1541

  Cormode, Graham ^a   Hadjieleftheriou, Marios ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STREAM; DATA STREAM MINING; EXPERIMENTAL CONDITIONS; HIGH-ACCURACY; INDUSTRIAL SYSTEMS; RELATED WORKS;

DATA COMMUNICATION SYSTEMS;

EID: 84867128082     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1454159.1454225     Document Type: Article

References (39)

1. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. In ACM Symposium on Theory of Computing, pages 20-29, 1996.
2. A. Arasu and G. S. Manku. Approximate counts and quantiles over sliding windows. In ACM PODS, 2004.
3. N. Bandi, A. Metwally, D. Agrawal, and A. E. Abbadi. Fast data stream algorithms using associative memories. In ACM SIGMOD, 2007.
4. S. Bhattacharrya, A. Madeira, S. Muthukrishnan, and T. Ye. How to scalably skip past streams. In Scalable Stream Processing Systems (SSPS) Workshop with ICDE 2007, 2007.
5. L. Bhuvanagiri, S. Ganguly, D. Kesh, and C. Saha. Simpler algorithm for estimating frequency moments of data streams. In ACM-SIAM Symposium on Discrete Algorithms, 2006.
6. A. Blum, P. Gibbons, D. Song, and S. Venkataraman. New streaming algorithms for fast detection of superspreaders. Technical Report IRP-TR-04-23, Intel Research, 2004.
7. P. Bose, E. Kranakis, P. Morin, and Y. Tang. Bounds for frequency estimation of packet streams. In SIROCCO, 2003.
8. B. Boyer and J. Moore. A fast majority vote algorithm. Technical Report ICSCA-CMP-32, Institute for Computer Science, University of Texas, Feb. 1981.
9. R. S. Boyer and J. S. Moore. MJRTY - a fast majority vote algorithm. In Automated Reasoning: Essays in Honor of Woody Bledsoe, Automated Reasoning Series, pages 105-117. Kluwer Academic Publishers, 1991.
10. A. Chakrabarti, G. Cormode, and A. McGregor. A near-optimal algorithm for computing the entropy of a stream. In ACM-SIAM Symposium on Discrete Algorithms, 2007.
11. M. Charikar, K. Chen, and M. Farach-Colton. Finding frequent items in data streams. In Procedings of the International Colloquium on Automata, Languages and Programming (ICALP), 2002.
12. G. Cormode and M. Hadjieleftheriou. Finding Frequent Items in Data Streams: Source Code. http://www.research.att.com/~marioh/frequent-items.html.
13. G. Cormode, F. Korn, S. Muthukrishnan, T. Johnson, O. Spatscheck, and D. Srivastava. Holistic UDAFs at streaming speeds. In ACM SIGMOD, pages 35-46, 2004.
14. G. Cormode, F. Korn, S. Muthukrishnan, and D. Srivastava. Space- and time-efficient deterministic algorithms for biased quantiles over data streams. In ACM PODS, 2006.
15. G. Cormode, F. Korn, and S. Tirthapura. Exponentially decayed aggregates on data streams. In IEEE International Conference on Data Engineering, 2008.
16. G. Cormode and S. Muthukrishnan. MassDAL Public Code Bank. http://www.cs.rutgers.edu/~muthu/ massdal-code-index.html.
17. G. Cormode and S. Muthukrishnan. What's new: Finding significant differences in network data streams. In Proceedings of IEEE Infocom, 2004.
18. G. Cormode and S. Muthukrishnan. An improved data stream summary: The count-min sketch and its applications. Journal of Algorithms, 55(1):58-75, 2005.
19. M. Datar, A. Gionis, P. Indyk, and R. Motwani. Maintaining stream statistics over sliding windows. In ACM-SIAM Symposium on Discrete Algorithms, 2002.
20. E. Demaine, A. López-Ortiz, and J. I. Munro. Frequency estimation of internet packet streams with limited space. In European Symposium on Algorithms (ESA), 2002.
21. A. Dobra and F. Rusu. Statistical analysis of sketch estimators. In ACM SIGMOD, 2007.
22. M. Fischer and S. Salzburg. Finding a majority among n votes: Solution to problem 81-5. Journal of Algorithms, 3(4):376-379, 1982.
23. A. C. Gilbert, Y. Kotidis, S. Muthukrishnan, and M. Strauss. How to summarize the universe: Dynamic maintenance of quantiles. In International Conference on Very Large Data Bases, pages 454-465, 2002.
24. M. Greenwald and S. Khanna. Space-efficient online computation of quantile summaries. In ACM SIGMOD, 2001.
25. J. Hershberger, N. Shrivastava, S. Suri, and C. Toth. Adaptive spatial partitioning for multidimensional data streams. In ISAAC, 2004.
26. T. S. Jayram, A. McGregor, S. Muthukrishnan, and E. Vee. Estimating statistical aggregates on probabilistic data streams. In ACM PODS, 2007.
27. R. Karp, C. Papadimitriou, and S. Shenker. A simple algorithm for finding frequent elements in sets and bags. ACM Transactions on Database Systems, 28:51-55, 2003.
28. G. Kollios, J. Byers, J. Considine, M. Hadjieleftheriou, and F. Li. Robust aggregation in sensor networks. IEEE Data Engineering Bulletin, 28(1), Mar. 2005.
29. L. Lee and H. Ting. A simpler and more efficient deterministic scheme for finding frequent items over sliding windows. In ACM PODS, 2006.
30. G. Manku and R. Motwani. Approximate frequency counts over data streams. In International Conference on Very Large Data Bases, pages 346-357, 2002.
31. G. S. Manku. Frequency counts over data streams. http://www.cse.ust.hk/vldb2002/ VLDB2002-proceedings/slides/ S10P03slides.pdf, 2002.
32. A. Metwally, D. Agrawal, and A. E. Abbadi. Efficient computation of frequent and top-k elements in data streams. In International Conference on Database Theory, 2005.
33. A. Metwally, D. Agrawal, and A. E. Abbadi. Why go logarithmic if we can go linear?: Towards effective distinct counting of search traffic. In International Conference on Extending Database Technology, 2008.
34. J. Misra and D. Gries. Finding repeated elements. Science of Computer Programming, 2:143-152, 1982.
35. R. Pike, S. Dorward, R. Griesemer, and S. Quinlan. Interpreting the data: Parallel analysis with sawzall. Dynamic Grids and Worldwide Computing, 13(4):277-298, 2005.
36. R. Schweller, Z. Li, Y. Chen, Y. Gao, A. Gupta, Y. Zhang, P. A. Dinda, M.-Y. Kao, and G. Memik. Reversible sketches: enabling monitoring and analysis over high-speed data streams. IEEE Transactions on Networks, 15(5):1059-1072, 2007.
37. N. Shrivastava, C. Buragohain, D. Agrawal, and S. Suri. Medians and beyond: New aggregation techniques for sensor networks. In ACM SenSys, 2004.
38. M. Thorup. Even strongly universal hashing is pretty fast. In ACM-SIAM Symposium on Discrete Algorithms, 2000.
39. M. Thorup and Y. Zhang. Tabulation based 4-universal hashing with applications to second moment estimation. In ACM-SIAM Symposium on Discrete Algorithms, 2004.