The complexity of querying external memory and streaming data

Lecture Notes in Computer Science

Volumn 3623, Issue , 2005, Pages 1-16

  Grohe, Martin ^a   Koch, Christoph ^b   Schweikardt, Nicole ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

^b SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STORAGE EQUIPMENT; XML;

STREAMING DATA; XML QUERY PROCESSING;

COMPUTER SCIENCE;

EID: 26844494971     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11537311_1     Document Type: Conference Paper

References (26)

1. G. Aggarwal, M. Datar, S. Rajagopalan, and M. Ruhl. On the streaming model augmented with a sorting primitive. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pages 540-549, 2004.
2. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximationg the frequency moments. Journal of Computer and System Sciences, 58:137-147, 1999.
3. A. Arasu, B. Babcock, T. Green, A. Gupta, and J. Widom. Characterizing memory requirements for queries over continuous data streams. In Proceedings of the 21st ACM Symposium on Principles of Database Systems, pages 221-232, 2002.
4. 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, pages 1-16, 2002.
5. Z. Bar-Yossef, M. Fontoura, and V. Josifovski. On the memory requirements of XPath evaluation over XML streams. In Proceedings of the 23rd ACM Symposium on Principles of Database Systems, pages 177-188, 2004.
6. Z. Bar-Yossef, M. Fontoura, and V. Josifovski. Buffering in query evaluation over XML streams. In Proceedings of the 24th ACM Symposium on Principles of Database Systems, 2005. To appear.
7. P. Duris, Z. Galil, and G. Schnitger. Lower bounds on communication complexity. Information and Computation, 73:1-22, 1987.
8. G. Gottlob, C. Koch, and R. Pichler. Efficient algorithms for processing XPath queries. In Proceedings of the 28th International Conference on Very Large Data Bases, 2002.
9. G. Gottlob, C. Koch, and R. Pichler. The complexity of XPath query evaluation. In Proceedings of the 22nd ACM Symposium on Principles of Database Systems, pages 179-190, 2003.
10. G. Graefe. Query evaluation techniques for large databases. ACM Computing Surveys, 25(2):73-170, 1993.
11. M. Grohe, C. Koch, and N. Schweikardt. Tight lower bounds for query processing on streaming and external memory data. In Proceedings of the 32nd International Colloquium on Automata, Languages and Programming, 2005. To appear.
12. M. Grohe and N. Schweikardt. Lower bounds for sorting with few random accesses to external memory. In Proceedings of the 24th ACM Symposium on Principles of Database Systems, 2005. To appear.
13. M. Grohe and N. Schweikardt. Unpublished manuscript, available from the authors, 2005.
14. M. Henzinger, P. Raghavan, and S. Rajagopalan. Computing on data streams. In External memory algorithms, volume 50, pages 107-118. DIMACS Series In Discrete Mathematics And Theoretical Computer Science, 1999.
15. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.
16. U. Meyer, P. Sanders, and J.F. Sibeyn, editors. Algorithms for Memory Hierarchies, volume 2832 of Lecture Notes in Computer Science. Springer-Verlag, 2003.
17. J.J. Munro and M.S. Paterson. Selection and sorting with limited storage. Theoretical Computer Science, 12:315-323, 1980.
18. S. Muthukrishnan. Data streams: algorithms and applications. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 413-413, 2003.
19. A. Neumann and H. Seidl. Locating matches of tree patterns in forests. In V. Chandru and V. Vinay, editors, Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science, volume 1530 of Lecture Notes in Computer Science, pages 134-145, 1998.
20. Raghu Ramakrishnan and Johannes Gehrke. Database Management Systems. McGraw-Hill, 2002.
21. A.A. Razborov. Applications of matrix methods to the theory of lower bounds in computational complexity. Combinatorica, 10:81-93, 1990.
22. L. Segoufin and V. Vianu. Validating streaming XML documents. In Proceedings of the 21st ACM Symposium on Principles of Database Systems, pages 53-64, 2002.
23. Luc Segoufin. Typing and querying XML documents: Some complexity bounds. In Proceedings of the 22nd ACM Symposium on Principles of Database Systems, pages 167-178, 2003.
24. J.F. Vitter. External memory algorithms and data structures: Dealing with massive data. ACM Computing Surveys, 33:209-271, 2001.
25. K. Wagner and G. Wechsung. Computational Complexity. VEB Deutscher Verlag der Wissenschaften, 1986.
26. A. Yao. Some complexity questions related to distributive computing. In Proceedings of the 11th ACM Symposium on Theory of Computing, pages 209-213, 1979.