Abstract
We review a recently introduced computation model for streaming and external memory data. An important feature of this model is that it distinguishes between sequentially reading (streaming) data from external memory (through main memory) and randomly accessing external memory data at specific memory locations; it is well-known that the latter is much more expensive in practice. We explain how a number of lower bound results are obtained in this model and how they can be applied for proving lower bounds for XML query processing.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aggarwal, G., Datar, M., Rajagopalan, S., Ruhl, M.: On the streaming model augmented with a sorting primitive. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 540–549 (2004)
Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximationg the frequency moments. Journal of Computer and System Sciences 58, 137–147 (1999)
Arasu, A., Babcock, B., Green, T., Gupta, A., Widom, J.: Characterizing memory requirements for queries over continuous data streams. In: Proceedings of the 21st ACM Symposium on Principles of Database Systems, pp. 221–232 (2002)
Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J.: Models and issues in data stream systems. In: Proceedings of the 21st ACM Symposium on Principles of Database Systems, pp. 1–16 (2002)
Bar-Yossef, Z., Fontoura, M., Josifovski, V.: On the memory requirements of XPath evaluation over XML streams. In: Proceedings of the 23rd ACM Symposium on Principles of Database Systems, pp. 177–188 (2004)
Bar-Yossef, Z., Fontoura, M., Josifovski, V.: Buffering in query evaluation over XML streams. In: Proceedings of the 24th ACM Symposium on Principles of Database Systems (2005) (to appear)
Duris, P., Galil, Z., Schnitger, G.: Lower bounds on communication complexity. Information and Computation 73, 1–22 (1987)
Gottlob, G., Koch, C., Pichler, R.: Efficient algorithms for processing XPath queries. In: Proceedings of the 28th International Conference on Very Large Data Bases (2002)
Gottlob, G., Koch, C., Pichler, R.: The complexity of XPath query evaluation. In: Proceedings of the 22nd ACM Symposium on Principles of Database Systems, pp. 179–190 (2003)
Graefe, G.: Query evaluation techniques for large databases. ACM Computing Surveys 25(2), 73–170 (1993)
Grohe, M., Koch, C., Schweikardt, N.: 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)
Grohe, M., Schweikardt, N.: 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)
Grohe, M., Schweikardt, N.: Unpublished manuscript, available from the authors (2005)
Henzinger, M., Raghavan, P., Rajagopalan, S.: Computing on data streams. In: External memory algorithms. DIMACS Series In Discrete Mathematics And Theoretical Computer Science, vol. 50, pp. 107–118 (1999)
Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)
Meyer, U., Sanders, P., Sibeyn, J.F. (eds.): Algorithms for Memory Hierarchies. LNCS, vol. 2832. Springer, Heidelberg (2003)
Munro, J.J., Paterson, M.S.: Selection and sorting with limited storage. Theoretical Computer Science 12, 315–323 (1980)
Muthukrishnan, S.: Data streams: algorithms and applications. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 413–413 (2003)
Neumann, A., Seidl, H.: Locating matches of tree patterns in forests. In: Arvind, V., Sarukkai, S. (eds.) FST TCS 1998. LNCS, vol. 1530, pp. 134–146. Springer, Heidelberg (1998)
Ramakrishnan, R., Gehrke, J.: Database Management Systems. McGraw-Hill, New York (2002)
Razborov, A.A.: Applications of matrix methods to the theory of lower bounds in computational complexity. Combinatorica 10, 81–93 (1990)
Segoufin, L., Vianu, V.: Validating streaming XML documents. In: Proceedings of the 21st ACM Symposium on Principles of Database Systems, pp. 53–64 (2002)
Segoufin, L.: Typing and querying XML documents: Some complexity bounds. In: Proceedings of the 22nd ACM Symposium on Principles of Database Systems, pp. 167–178 (2003)
Vitter, J.F.: External memory algorithms and data structures: Dealing with massive data. ACM Computing Surveys 33, 209–271 (2001)
Wagner, K., Wechsung, G.: Computational Complexity. VEB Deutscher Verlag der Wissenschaften (1986)
Yao, A.: Some complexity questions related to distributive computing. In: Proceedings of the 11th ACM Symposium on Theory of Computing, pp. 209–213 (1979)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grohe, M., Koch, C., Schweikardt, N. (2005). The Complexity of Querying External Memory and Streaming Data. In: Liśkiewicz, M., Reischuk, R. (eds) Fundamentals of Computation Theory. FCT 2005. Lecture Notes in Computer Science, vol 3623. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11537311_1
Download citation
DOI: https://doi.org/10.1007/11537311_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28193-1
Online ISBN: 978-3-540-31873-6
eBook Packages: Computer ScienceComputer Science (R0)