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
LEINDERS, Dirk 
Schweikardt, Nicole
Tyszkiewicz, Jerzy
VAN DEN BUSSCHE, Jan 
Issue Date: 2007
Publisher: Springer Berlin / Heidelberg
Source: Database Theory - ICDT 2007. p. 284-298
Series/Report: Lecture Notes in Computer Science
Series/Report no.: 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.
Document URI: http://hdl.handle.net/1942/7847
ISBN: 978-3-540-69269-0
DOI: 10.1007/11965893_20
Category: C1
Type: Proceedings Paper
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
GGL07.pdfPublished version426.45 kBAdobe PDFView/Open
Show full item record

SCOPUSTM   
Citations

5
checked on Sep 2, 2020

WEB OF SCIENCETM
Citations

2
checked on May 14, 2022

Page view(s)

74
checked on May 20, 2022

Download(s)

260
checked on May 20, 2022

Google ScholarTM

Check

Altmetric


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