Space efficient mining of multigraph streams

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

Volumn , Issue , 2005, Pages 271-282

  Cormode, Graham ^a   Muthukrishnan, S ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION MULTIGRAPHS; MULTIGRAPH STREANS; MULTIPLE ESTIMATION TECHNIQUES;

ALGORITHMS; COMPUTATION THEORY; GRAPH THEORY;

DATA MINING;

EID: 33244491040     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1065167.1065201     Document Type: Conference Paper

References (33)

1. N. Alon, P. Gibbons, Y. Matias, and M. Szegedy. Tracking join and self-join sizes in limited storage. In Proceedings of the Eighteenth ACM Symposium on Principles of Database Systems, pages 10-20, 1999.
2. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 20-29, 1996.
3. Journal version in Journal of Computer and System Sciences, 58:137-147, 1999.
4. A. Arasu, B. Babcock, S. Babu, M. Datar, K. Ito, I. Nishizawa, J. Rosenstein, and J. Widom. STREAM: the Stanford Stream Data Manager (demonstration description). In Proceedings of ACM SIGMOD International Conference on Management of Data, pages 665-665, 2003.
5. B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom. Models and issues in data stream systems. In Proceedings of ACM Principles of Database Systems, pages 1-16, 2002.
6. Z. Bar-Yossef, T. Jayram, R. Kumar, D. Sivakumar, and L. Trevisian. Counting distinct elements in a data stream. In Proceedings of RANDOM 2002, pages 1-10, 2002.
7. Z. Bar-Yossef, R. Kumar, and D. Sivakumar. Reductions in streaming algorithms, with an application to counting triangles in graphs. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 623-632, 2002.
8. 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.
9. 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), pages 693-703, 2002.
10. G. Cormode, M. Datar, P. Indyk, and S. Muthukrishnan. Comparing data streams using Hamming norms. In Proceedings of the International Conference on Very Large Data Bases, pages 335-345, 2002.
11. Journal version in IEEE Transactions on Knowledge and Data Engineering 15(3):529-541, 2003.
12. G. Cormode and S. Muthukrishnan. An improved data stream summary: The count-min sketch and its applications. In Latin American Informatics, pages 29-38, 2004.
13. C. Cranor, T. Johnson, O. Spatscheck, and V. Shkapenyuk. Gigascope: A stream database for network applications. In Proceedings of ACM SIGMOD International Conference on Management of Data, pages 647-651, 2003.
14. M. Datar and S. Muthukrishnan. Estimating rarity and similarity over data stream windows. In Proceedings of 10th Annual European Symposium on Algorithms, volume 2461 of Lecture Notes in Computer Science, pages 323-334, 2002.
15. C. Estan and G. Varghese. New directions in traffic measurement and accounting. In Proceedings of ACM SIGCOMM, volume 32, 4 of Computer Communication Review, pages 323-338, 2002.
16. J. Feigenbaum, S. Kannan, A. McGregor, S. Suri, and J. Zhang. On graph problems in a semi-streaming model. In Proceedings of the International Colloquium on Automata, Languages, and Programming, 2004.
17. J. Feigenbaum, S. Kannan, A. McGregor, S. Suri, and J. Zhang. Graph distances in the streaming model: The value of space. In Proceedings of ACM-SIAM Symposium on Discrete Algorithms, 2005.
18. P. Flajolet and G. N. Martin. Probabilistic counting. In 24th Annual Symposium on Foundations of Computer Science, pages 76-82, 1983.
19. Journal version in Journal of Computer and System Sciences, 31:182-209, 1985.
20. S. Ganguly, M. Garofalakis, and R. Rastogi. Processing set expressions over continuous update streams. In Proceedings of ACM SIGMOD International Conference on Management of Data, pages 265-276, 2003.
21. M. Garofalakis, J. Gehrke, and R. Rastogi. Querying and mining data streams: You only get one look. In Proceedings of ACM SIGMOD International Conference on Management of Data, 2002.
22. P. Gibbons. Distinct sampling for highly-accurate answers to distinct values queries and event reports. In Proceedings of the International Conference on Very Large Data Bases, pages 541-550, 2001.
23. P. Gibbons and S. Tirthapura. Estimating simple functions on the union of data streams. In Proceedings of the 13th ACM Symposium on Parallel Algorithms and Architectures, pages 281-290, 2001.
24. M. Henzinger, P. Raghavan, and S. Rajagopalan. Computing on data streams. Technical Report SRC 1998-011, DEC Systems Research Centre, 1998.
25. P. Indyk. A small approximately min-wise independent family of hash functions. Journal of Algorithms, 38(1):84-90, 2001.
26. E. Kohler, J. Li, V. Paxson, and S. Shenker. Observed structure of addresses in IP traffic. In ACM SIGCOMM Internet Measurement Workshop, pages 253-266, 2002.
27. N. Koudas and D. Srivastava. Data stream query processing: A tutorial. In Proceedings of the International Conference on Very Large Data Bases, page 1149, 2003.
28. Internet traffic archive, http://ita.ee.lbl.gov/.
29. G. Manku and R. Motwani. Approximate frequency counts over data streams. In Proceedings of the International Conference on Very Large Data Bases, pages 346-357, 2002.
30. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
31. S. Muthukrishnan. Data streams: Algorithms and applications. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, 2003.
32. S. Nath, P. B. Gibbons, S. Seshan, and Z. R. Anderson. Synopsis diffusion for robust aggrgation in sensor networks. In A CM SenSys, 2004.
33. V. Paxson. Empirically derived analytic models of wide-area TCP connections. IEEE ACM Transactions on Networking, 2(4):316-336, 1994.