Trading off space for passes in graph streaming problems

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 714-723

  Demetrescu, Camil ^a   Finocchi, Irene ^a   Ribichini, Andrea ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; DATA STRUCTURES; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY; STATISTICS;

CLASSICAL GRAPH PROBLEMS; CLASSICAL STREAMING MODELS; COMPUTATIONAL POWER; DATA SKETCHING;

GRAPH THEORY;

EID: 33244458713     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109635     Document Type: Conference Paper

References (25)

1. J. Abello, A. Buchsbaum, and J. R. Westbrook. A functional approach to external graph algorithms. Algorithmica, 32(3):437-458, 2002.
2. G. Aggarwal, M. Datar, S. Rajagopalan, and M. Ruhl. On the streaming model augmented with a sorting primitive. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOGS), 2004.
3. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. Journal of Computer and System Sciences, 58(1):137-147, 1999.
4. H. Alt, V. Geffert, and K. Mehlhorn. A lower bound for the nondeterministic space complexity of context free recognition. Information Processing Letters, 42:25-27, 1992.
5. B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom. Models and issues in data stream systems. In Proceedings of the 21st ACM Symposium on Principles of Database Systems (PODS), pages 1-16, 2002.
6. Z. Bar-Yossef, R. Kumar, and D. Sivakumar. Reductions in streaming algorithms, with an application to counting triangles in graphs. In Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms (SODA 2002), San Francisco, California, pp. 623-632, 2002.
7. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms, Second Edition. The MIT Press, 2001.
8. J. Feigenbaum, S. Kannan, A. McGregor, S. Suri, and J. Zhang. On graph problems in a semi-streaming model. In Proc. of the International Colloquium on Automata, Languages and Programming (ICALP), 2004.
9. J. Feigenbaum, S. Kannan, A. McGregor, S. Suri, and J. Zhang. Graph distances in the streaming model: the value of space. In Proceedings of the 16th ACM/SIAM Symposium on Discrete Algorithms (SODA), pages 745-754, 2005.
10. 1 difference algorithm for massive data streams. SIAM Journal on Computing, 32(1):131-151, 2002.
11. A. C. Gilbert, S. Guha, P. Indyk, Y. Kotidis, S. Muthukrishnan, and M. Strauss. Fast, small-space algorithms for approximate histogram maintenance. In Proceedings of the 34th ACM Symposium on Theory of Computing (STOC), pages 389-398, 2002.
12. A. C. Gilbert, Y. Kotidis, S. Muthukrishnan, and M. Strauss. Quicksand: Quick summary and analysis of network data. Technical report, DIMACS Technical Report 2001-43, 2001.
13. L. Golab and M. T. Ozsu. Data stream management issues a survey. Technical report, School of Computer Science, University of Waterloo, TR CS-2003-08, 2003.
14. D. H. Greene and D.E. Knuth. Mathematics for the analysis of algorithms. Birkhäuser, 1982.
15. M. Grigni and M. Sipser. Monotone separation of logarithmic space from logarithmic depth. Journal of Computer and System Sciences, 50:433-437, 1995.
16. M. Henzinger and V. King. Fully dynamic biconnectivity and transitive closure. In Proc. 36th IEEE Symposium on Foundations of Computer Science (FOGS'95), pages 664-672, 1995.
17. M. Henzinger, P. Raghavan, and S. Rajagopalan. Computing on data streams. In "External Memory algorithms", DIMACS series in Discrete Mathematics and Theoretical Computer Science, 50:107-118, 1999.
18. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.
19. A. McGregor. Finding matchings in the streaming model. In Proceedings of the 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2005), to appear, 2005.
20. I. Munro and M. Paterson. Selection and sorting with limited storage. Theoretical Computer Science, 12:315-323, 1980.
21. S. Muthukrishnan. Data streams: algorithms and applications. Technical report, 2003. Available at http://athos.rutgers.edu/~muthu/stream-1-1.ps.
22. M. Ruhl. Efficient Algorithms for New Computational Models. PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 2003.
23. M. Sullivan and A. Heybey. Tribeca: A system for managing large databases of network traffic. In Proceedings USENIX Annual Technical Conference, 1998.
24. J.D. Ullman and M. Yannakakis. High-probability parallel transitive-closure algorithms. SIAM Journal on Computing, 20(1):100-125, 1991.
25. J. S. Vitter. External memory algorithms and data structures: Dealing with massive data. ACM Computing Surveys, 33(2):209-271, 2001.