Abstract
We introduce a new abstract model of database query processing, finite cursor machines, that incorporates certain data streaming aspects. The model describes quite faithfully what happens in so-called “one-pass” and “two-pass query processing”. Technically, the model is described in the framework of abstract state machines. Our main results are upper and lower bounds for processing relational algebra queries in this model, specifically, queries of the semijoin fragment of the relational algebra.
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 IEEE Symposium on Foundations of Computer Science, pp. 540–549 (2004)
Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. J. Comput. Syst. Sci. 58, 137–147 (1999)
Altinel, M., Franklin, M.: Efficient filtering of XML documents for selective dissemination of information. In: Proceedings of the 26th International Conference on Very Large Data Bases, pp. 53–64 (2000)
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, pp. 216–227 (2005)
Chan, C.Y., Felber, P., Garofalakis, M.N., Rastogi, R.: Efficient filtering of XML documents with XPath expressions. VLDB J. 11, 354–379 (2002)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Berlin (1999)
Fagin, R.: Degrees of acyclicity for hypergraphs and relational database schemes. J. ACM 30, 514–550 (1983)
Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Berlin (2006)
Garcia-Molina, H., Ullman, J.D., Widom, J.: Database System Implementation. Prentice-Hall, New York (1999)
Green, T.J., Miklau, G., Onizuka, M., Suciu, D.: Processing XML streams with deterministic automata. In: Proceedings of the 9th International Conference on Database Theory, pp. 173–189 (2003)
Grohe, M., Koch, C., Schweikardt, N.: Tight lower bounds for query processing on streaming and external memory data. In: Proceedings of the 31st International Colloquium on Automata, Languages and Programming, pp. 1076–1088 (2005)
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, pp. 238–249 (2005)
Gupta, A.K., Suciu, D.: Stream processing of XPath queries with predicates. In: Proceedings of the 22th ACM SIGMOD International Conference on Management of Data, pp. 419–430 (2003)
Gurevich, Y.: Evolving algebras 1993: Lipari guide. In: Börger, E. (ed.) Specification and Validation Methods, pp. 9–36. Oxford University Press, London (1995)
Gurevich, Y.: Sequential abstract-state machines capture sequential algorithms. ACM Trans. Comput. Logic 1(1), 77–111 (2000)
Hella, L., Libkin, L., Nurmonen, J., Wong, L.: Logics with aggregate operators. J. ACM 48(4), 880–907 (2001)
Henzinger, M., Raghavan, P., Rajagopalan, S.: Computing on data streams. External memory algorithms. In: DIMACS Ser. in Discrete Math. Theor. Comput. Sci., vol. 50, pp. 107–118. AMS, Providence (1999)
Hromkovič, J.: One-way multihead deterministic finite automata. Acta Inf. 19, 377–384 (1983)
Law, Y.-N., Wang, H., Zaniolo, C.: Query languages and data models for database sequences and data streams. In: Proceedings of the 30th International Conference on Very Large Data Bases, pp. 492–503 (2004)
Leinders, D., Van den Bussche, J.: On the complexity of division and set joins in the relational algebra. In: Proceedings of the 24th ACM Symposium on Principles of Database Systems, pp. 76–83 (2005)
Leinders, D., Marx, M., Tyszkiewicz, J., Van den Bussche, J.: The semijoin algebra and the guarded fragment. J. Logic Lang. Inf. 14(3), 331–343 (2005)
Leinders, D., Tyszkiewicz, J., Van den Bussche, J.: On the expressive power of semijoin queries. Inf. Process. Lett. 91(2), 93–98 (2004)
Libkin, L.: Elements of Finite Model Theory. Springer, Berlin (2004)
Muthukrishnan, S.: Data Streams: Algorithms and Applications. Now Publishers (2005)
Peng, F., Chawathe, S.S.: XPath queries on streaming data. In: Proceedings of the 22th ACM SIGMOD International Conference on Management of Data, pp. 431–442 (2003)
Rosenberg, A.L.: On multi-head finite automata. In: Proceedings of the 6th IEEE Symposium on Switching Circuit Theory and Logical Design, pp. 221–228 (1965)
Simmen, D., Shekita, E., Malkemus, T.: Fundamental techniques for order optimization. In: Proceedings of the 15th ACM SIGMOD International Conference on Management of Data, pp. 57–67 (1996)
Van den Bussche, J.: Finite cursor machines in database query processing. In: Proceedings of the 11th International Workshop on Abstract State Machines (2004)
Yannakakis, M.: Algorithms for acyclic database schemes. In: Proceedings of the 7th International Conference on Very Large Data Bases, pp. 82–94 (1981)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Grohe, M., Gurevich, Y., Leinders, D. et al. Database Query Processing Using Finite Cursor Machines. Theory Comput Syst 44, 533–560 (2009). https://doi.org/10.1007/s00224-008-9137-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-008-9137-7