Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/716
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | VAN DEN BUSSCHE, Jan | - |
dc.date.accessioned | 2005-04-12T08:17:30Z | - |
dc.date.available | 2005-04-12T08:17:30Z | - |
dc.date.issued | 2001 | - |
dc.identifier.citation | Theoretical Computer Science, 254(1-2). p. 363-377 | - |
dc.identifier.issn | 0304-3975 | - |
dc.identifier.uri | http://hdl.handle.net/1942/716 | - |
dc.description.abstract | Paredaens and Van Gucht proved that the flat relational algebra has the same expressive power as the nested relational algebra, as far as queries over flat relations and with flat results are concerned. We provide a new, very direct proof of this fact using a simulation technique. Our technique is also applied to partially answer a question posed by Suciu and Paredaens regarding the complexity of evaluating powerset algebra expressions. Specifically, we show that when only unary flat relations are into play, any powerset algebra expression is either equivalent to a nested algebra expression, or its evaluation will produce intermediate results of exponential size. | - |
dc.format.extent | 280502 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | Elsevier | - |
dc.title | Simulation of the nested relational algebra by the flat relational algebra, with an application to the complexity of evaluating powerset algebra expressions | - |
dc.type | Journal Contribution | - |
dc.identifier.epage | 377 | - |
dc.identifier.issue | 1-2 | - |
dc.identifier.spage | 363 | - |
dc.identifier.volume | 254 | - |
local.bibliographicCitation.jcat | A1 | - |
local.type.refereed | Refereed | - |
local.type.specified | Article | - |
dc.bibliographicCitation.oldjcat | A1 | - |
dc.identifier.doi | 10.1016/S0304-3975(99)00301-1 | - |
dc.identifier.isi | 000167791900013 | - |
item.fullcitation | VAN DEN BUSSCHE, Jan (2001) Simulation of the nested relational algebra by the flat relational algebra, with an application to the complexity of evaluating powerset algebra expressions. In: Theoretical Computer Science, 254(1-2). p. 363-377. | - |
item.fulltext | With Fulltext | - |
item.validation | ecoom 2002 | - |
item.contributor | VAN DEN BUSSCHE, Jan | - |
item.accessRights | Open Access | - |
crisitem.journal.issn | 0304-3975 | - |
crisitem.journal.eissn | 1879-2294 | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
simulation.pdf | 273.93 kB | Adobe PDF | View/Open |
SCOPUSTM
Citations
20
checked on Sep 2, 2020
WEB OF SCIENCETM
Citations
19
checked on Sep 26, 2024
Page view(s)
88
checked on Jun 14, 2023
Download(s)
192
checked on Jun 14, 2023
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.