Database query processing using finite cursor machines

TL;DR: A new abstract model of database query processing, finite cursor machines, that incorporates certain data streaming aspects and upper and lower bounds for processing relational algebra queries in this model are introduced.

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