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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Grohe, M., Gurevich, Y., Leinders, D., Schweikardt, N., Tyszkiewicz, J., & Van Den Bussche, J. (2006). Database query processing using finite cursor machines. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4353 LNCS, pp. 284–298). https://doi.org/10.1007/11965893_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
