Database Query Processing Using Finite Cursor Machines

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 ng”. 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. Keywords Database · Relational algebra · Semijoin · Query processing

• Type: Conference
• Year: 2007
• Where: ICDT
• Authors: Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz, Jan Van den Bussche
• Keywords: Database, Database Query Processing, ICDT 2007, Query Processing, Relational Algebra