Document Server@UHasselt >
Research >
Research publications >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/7948

Title: Relational completeness of query languages for annotated databases
Authors: GEERTS, Floris
Issue Date: 2007
Publisher: Springer
Citation: Database Programming Languages. p. 127-137
Series/Report: Lecture Notes in Computer Science, 4797
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.
URI: http://hdl.handle.net/1942/7948
DOI: 10.1007/978-3-540-75987-4_9
ISI #: 000250804700009
ISBN: 978-3-540-75986-7
ISSN: 1611-3349
Category: A1
Type: Journal Contribution
Appears in Collections: Research publications

Files in This Item:

There are no files associated with this item.

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