Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/7847
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.accessioned2008-02-08T15:43:00Z-
dc.date.available2008-02-08T15:43:00Z-
dc.date.issued2007-
dc.identifier.citationDatabase Theory - ICDT 2007. p. 284-298-
dc.identifier.isbn978-3-540-69269-0-
dc.identifier.issn1611-3349-
dc.identifier.urihttp://hdl.handle.net/1942/7847-
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 Berlin / Heidelberg-
dc.relation.ispartofseriesLecture Notes in Computer Science-
dc.titleDatabase query processing using finite cursor machines-
dc.typeProceedings Paper-
local.bibliographicCitation.authorsSchwentick, Thomas-
local.bibliographicCitation.authorsSuciu, Dan-
local.bibliographicCitation.conferencedate2007-
local.bibliographicCitation.conferencenameInternational Conference on Database Theory-
dc.bibliographicCitation.conferencenr11-
local.bibliographicCitation.conferenceplaceBarcelona-
dc.identifier.epage298-
dc.identifier.spage284-
local.bibliographicCitation.jcatC1-
local.type.refereedRefereed-
local.type.specifiedProceedings Paper-
local.relation.ispartofseriesnr4353-
dc.bibliographicCitation.oldjcatC2-
dc.identifier.doi10.1007/11965893_20-
local.bibliographicCitation.btitleDatabase Theory - ICDT 2007-
item.contributorGrohe, Martin-
item.contributorGurevich, Yuri-
item.contributorLEINDERS, Dirk-
item.contributorSchweikardt, Nicole-
item.contributorTyszkiewicz, Jerzy-
item.contributorVAN DEN BUSSCHE, Jan-
item.accessRightsOpen Access-
item.fullcitationGrohe, Martin; Gurevich, Yuri; LEINDERS, Dirk; Schweikardt, Nicole; Tyszkiewicz, Jerzy & VAN DEN BUSSCHE, Jan (2007) Database query processing using finite cursor machines. In: Database Theory - ICDT 2007. p. 284-298.-
item.fulltextWith Fulltext-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
GGL07.pdfPublished version426.45 kBAdobe PDFView/Open
Show simple item record

SCOPUSTM   
Citations

5
checked on Sep 2, 2020

WEB OF SCIENCETM
Citations

2
checked on Apr 19, 2024

Page view(s)

80
checked on Sep 7, 2022

Download(s)

288
checked on Sep 7, 2022

Google ScholarTM

Check

Altmetric


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