Please use this identifier to cite or link to this item:
Title: Relational completeness of query languages for annotated databases
Authors: GEERTS, Floris 
Issue Date: 2007
Publisher: Springer
Source: Proceedings of the 11th International Workshop on Database Programming. p. 128-138
Series/Report: Lecture Notes in Computer Science
Series/Report no.: 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.
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
Keywords: Annotated relational databases; Expressive power; Query languages
Document URI:
ISBN: 978-3-540-75986-7
DOI: 10.1007/978-3-540-75987-4_9
Rights: (C) 2010 Elsevier Inc.
Category: C1
Type: Proceedings Paper
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
DBPL2007.pdfPublished version215.84 kBAdobe PDFView/Open
Show full item record

Google ScholarTM



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