Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/7847
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 | 2008-02-08T15:43:00Z | - |
dc.date.available | 2008-02-08T15:43:00Z | - |
dc.date.issued | 2007 | - |
dc.identifier.citation | Database Theory - ICDT 2007. p. 284-298 | - |
dc.identifier.isbn | 978-3-540-69269-0 | - |
dc.identifier.issn | 1611-3349 | - |
dc.identifier.uri | http://hdl.handle.net/1942/7847 | - |
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 Berlin / Heidelberg | - |
dc.relation.ispartofseries | Lecture Notes in Computer Science | - |
dc.title | Database query processing using finite cursor machines | - |
dc.type | Proceedings Paper | - |
local.bibliographicCitation.authors | Schwentick, Thomas | - |
local.bibliographicCitation.authors | Suciu, Dan | - |
local.bibliographicCitation.conferencedate | 2007 | - |
local.bibliographicCitation.conferencename | International Conference on Database Theory | - |
dc.bibliographicCitation.conferencenr | 11 | - |
local.bibliographicCitation.conferenceplace | Barcelona | - |
dc.identifier.epage | 298 | - |
dc.identifier.spage | 284 | - |
local.bibliographicCitation.jcat | C1 | - |
local.type.refereed | Refereed | - |
local.type.specified | Proceedings Paper | - |
local.relation.ispartofseriesnr | 4353 | - |
dc.bibliographicCitation.oldjcat | C2 | - |
dc.identifier.doi | 10.1007/11965893_20 | - |
local.bibliographicCitation.btitle | Database Theory - ICDT 2007 | - |
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.fulltext | With Fulltext | - |
item.accessRights | Open Access | - |
item.fullcitation | Grohe, 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. | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
GGL07.pdf | Published version | 426.45 kB | Adobe PDF | View/Open |
SCOPUSTM
Citations
5
checked on Sep 2, 2020
WEB OF SCIENCETM
Citations
2
checked on Oct 16, 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.