Relational Completeness of Query Languages for Annotated Databases

  • Floris Geerts
  • Jan Van den Bussche
Conference paper

DOI: 10.1007/978-3-540-75987-4_9

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4797)
Cite this paper as:
Geerts F., Van den Bussche J. (2007) Relational Completeness of Query Languages for Annotated Databases. In: Arenas M., Schwartzbach M.I. (eds) Database Programming Languages. DBPL 2007. Lecture Notes in Computer Science, vol 4797. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Floris Geerts
    • 1
    • 2
  • Jan Van den Bussche
    • 1
  1. 1.Hasselt University/Transnational University Limburg 
  2. 2.University of Edinburgh 

Personalised recommendations