Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/10659
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGrohe, Martin-
dc.contributor.authorGurevich, Yuri-
dc.contributor.authorLEINDERS, Dirk-
dc.contributor.authorSchweikardt, Nicole-
dc.contributor.authorTyszkiewicz, Jerzy-
dc.contributor.authorVAN DEN BUSSCHE, Jan-
dc.date.accessioned2010-03-04T10:12:01Z-
dc.date.available2010-03-04T10:12:01Z-
dc.date.issued2009-
dc.identifier.citationTHEORY OF COMPUTING SYSTEMS, 44(4). p. 533-560-
dc.identifier.issn1432-4350-
dc.identifier.urihttp://hdl.handle.net/1942/10659-
dc.description.abstractWe 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.-
dc.language.isoen-
dc.publisherSpringer New York-
dc.subject.otherDatabase, Relational algebra, Semijoin, Query processing-
dc.titleDatabase Query Processing Using Finite Cursor Machines-
dc.typeJournal Contribution-
dc.identifier.epage560-
dc.identifier.issue4-
dc.identifier.spage533-
dc.identifier.volume44-
local.bibliographicCitation.jcatA1-
dc.description.notes(1) Humboldt-University Berlin, Berlin, Germany (2) Microsoft Research, Redmond, WA, USA (3) Hasselt University and Transnational University of Limburg, Diepenbeek, Belgium (4) University of Warsaw, Warsaw, Poland-
local.type.refereedRefereed-
local.type.specifiedArticle-
dc.bibliographicCitation.oldjcatA1-
dc.identifier.doi10.1007/s00224-008-9137-7-
dc.identifier.isi000265399700003-
dc.identifier.urlhttp://hdl.handle.net/1942/7847-
item.validationecoom 2010-
item.fulltextNo Fulltext-
item.contributorGrohe, Martin-
item.contributorGurevich, Yuri-
item.contributorLEINDERS, Dirk-
item.contributorSchweikardt, Nicole-
item.contributorTyszkiewicz, Jerzy-
item.contributorVAN DEN BUSSCHE, Jan-
item.fullcitationGrohe, Martin; Gurevich, Yuri; LEINDERS, Dirk; Schweikardt, Nicole; Tyszkiewicz, Jerzy & VAN DEN BUSSCHE, Jan (2009) Database Query Processing Using Finite Cursor Machines. In: THEORY OF COMPUTING SYSTEMS, 44(4). p. 533-560.-
item.accessRightsClosed Access-
crisitem.journal.issn1432-4350-
crisitem.journal.eissn1433-0490-
Appears in Collections:Research publications
Show simple item record

SCOPUSTM   
Citations

10
checked on Jan 18, 2026

WEB OF SCIENCETM
Citations

7
checked on Jan 19, 2026

Google ScholarTM

Check

Altmetric


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