Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/7909
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | GEERTS, Floris | - |
dc.contributor.author | VAN DEN BUSSCHE, Jan | - |
dc.date.accessioned | 2008-02-26T08:37:56Z | - |
dc.date.available | 2008-02-26T08:37:56Z | - |
dc.date.issued | 2007 | - |
dc.identifier.citation | Proceedings of the 11th International Workshop on Database Programming. p. 128-138 | - |
dc.identifier.isbn | 978-3-540-75986-7 | - |
dc.identifier.issn | 1611-3349 | - |
dc.identifier.uri | http://hdl.handle.net/1942/7909 | - |
dc.description.abstract | Annotated relational databases can be queried either by simply making the annotations explicitly available along the ordinary data, or by adapting the standard query operators so that they have an implicit effect also on the annotations. We compare the expressive power of these two approaches. As a formal model for the implicit approach we propose the color algebra, an adaptation of the relational algebra to deal with the annotations. We show that the color algebra is relationally complete: it is equivalent to the relational algebra on the explicit annotations. Our result extends a similar completeness result established for the query algebra of the MONDRIAN annotation system, from unions of conjunctive queries to the full relational algebra. | - |
dc.language.iso | en | - |
dc.publisher | Springer | - |
dc.relation.ispartofseries | Lecture Notes in Computer Science | - |
dc.rights | (C) 2010 Elsevier Inc. | - |
dc.subject.other | Annotated relational databases; Expressive power; Query languages | - |
dc.title | Relational completeness of query languages for annotated databases | - |
dc.type | Proceedings Paper | - |
local.bibliographicCitation.authors | Arenas, Marcelo | - |
local.bibliographicCitation.authors | Schwartzbach, Michael I. | - |
local.bibliographicCitation.conferencedate | 2007 | - |
local.bibliographicCitation.conferencename | International Workshop on Database Programming Languages (DBPL) | - |
dc.bibliographicCitation.conferencenr | 11 | - |
local.bibliographicCitation.conferenceplace | Vienna, Austria | - |
dc.identifier.epage | 138 | - |
dc.identifier.spage | 128 | - |
local.bibliographicCitation.jcat | C1 | - |
dc.description.notes | Reprint Address: Geerts, F (reprint author), Univ Edinburgh, Edinburgh EH8 9YL, Midlothian, Scotland. Addresses: 1. Univ Edinburgh, Edinburgh EH8 9YL, Midlothian, Scotland 2. Transnct Univ Limburg, Hasselt Univ, Hasselt, Belgium | - |
local.type.refereed | Refereed | - |
local.type.specified | Proceedings Paper | - |
local.relation.ispartofseriesnr | 4797 | - |
dc.bibliographicCitation.oldjcat | C1 | - |
dc.identifier.doi | 10.1007/978-3-540-75987-4_9 | - |
local.bibliographicCitation.btitle | Proceedings of the 11th International Workshop on Database Programming | - |
item.fulltext | With Fulltext | - |
item.fullcitation | GEERTS, Floris & VAN DEN BUSSCHE, Jan (2007) Relational completeness of query languages for annotated databases. In: Proceedings of the 11th International Workshop on Database Programming. p. 128-138. | - |
item.contributor | GEERTS, Floris | - |
item.contributor | VAN DEN BUSSCHE, Jan | - |
item.accessRights | Open Access | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
DBPL2007.pdf | Published version | 215.84 kB | Adobe PDF | View/Open |
SCOPUSTM
Citations
13
checked on Sep 5, 2020
WEB OF SCIENCETM
Citations
8
checked on Mar 23, 2024
Page view(s)
68
checked on Sep 7, 2022
Download(s)
122
checked on Sep 7, 2022
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.