Document Server@UHasselt >
Research >
Research publications >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/7847

Title: Database query processing using finite cursor machines
Authors: Grohe, Martin
Gurevich, Yuri
Schweikardt, Nicole
Tyszkiewicz, Jerzy
Issue Date: 2007
Publisher: Springer Berlin / Heidelberg
Citation: Database Theory - ICDT 2007. p. 284-298
Series/Report: Lecture Notes in Computer Science, 4353
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.
URI: http://hdl.handle.net/1942/7847
DOI: 10.1007/11965893_20
ISBN: 978-3-540-69269-0
ISSN: 1611-3349
Category: C1
Type: Proceedings Paper
Appears in Collections: Research publications

Files in This Item:

Description SizeFormat
Published version426.45 kBAdobe PDF

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.