Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/10659
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Grohe, Martin | - |
dc.contributor.author | Gurevich, Yuri | - |
dc.contributor.author | LEINDERS, Dirk | - |
dc.contributor.author | Schweikardt, Nicole | - |
dc.contributor.author | Tyszkiewicz, Jerzy | - |
dc.contributor.author | VAN DEN BUSSCHE, Jan | - |
dc.date.accessioned | 2010-03-04T10:12:01Z | - |
dc.date.available | 2010-03-04T10:12:01Z | - |
dc.date.issued | 2009 | - |
dc.identifier.citation | THEORY OF COMPUTING SYSTEMS, 44(4). p. 533-560 | - |
dc.identifier.issn | 1432-4350 | - |
dc.identifier.uri | http://hdl.handle.net/1942/10659 | - |
dc.description.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. | - |
dc.language.iso | en | - |
dc.publisher | Springer New York | - |
dc.subject.other | Database, Relational algebra, Semijoin, Query processing | - |
dc.title | Database Query Processing Using Finite Cursor Machines | - |
dc.type | Journal Contribution | - |
dc.identifier.epage | 560 | - |
dc.identifier.issue | 4 | - |
dc.identifier.spage | 533 | - |
dc.identifier.volume | 44 | - |
local.bibliographicCitation.jcat | A1 | - |
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.refereed | Refereed | - |
local.type.specified | Article | - |
dc.bibliographicCitation.oldjcat | A1 | - |
dc.identifier.doi | 10.1007/s00224-008-9137-7 | - |
dc.identifier.isi | 000265399700003 | - |
dc.identifier.url | http://hdl.handle.net/1942/7847 | - |
item.fulltext | No Fulltext | - |
item.contributor | Grohe, Martin | - |
item.contributor | Gurevich, Yuri | - |
item.contributor | LEINDERS, Dirk | - |
item.contributor | Schweikardt, Nicole | - |
item.contributor | Tyszkiewicz, Jerzy | - |
item.contributor | VAN DEN BUSSCHE, Jan | - |
item.accessRights | Closed Access | - |
item.fullcitation | Grohe, 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.validation | ecoom 2010 | - |
crisitem.journal.issn | 1432-4350 | - |
crisitem.journal.eissn | 1433-0490 | - |
Appears in Collections: | Research publications |
SCOPUSTM
Citations
8
checked on Sep 2, 2020
WEB OF SCIENCETM
Citations
7
checked on Apr 22, 2024
Page view(s)
68
checked on May 30, 2023
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.