|
Title
|
|
|
|
Relational completeness of query languages for annotated databases
|
|
|
Author
|
|
|
|
|
|
|
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. We also show that the color algebra is nonredundant: no operator can be expressed in terms of the other operators. We also present a generalization of the color algebra that is relationally complete in the presence of built-in predicates on the annotations. |
|
|
|
Language
|
|
|
|
English
|
|
|
Source (journal)
|
|
|
|
Journal of computer and system sciences. - New York, N.Y.
|
|
|
Publication
|
|
|
|
New York, N.Y.
:
2011
|
|
|
ISSN
|
|
|
|
0022-0000
|
|
|
DOI
|
|
|
|
10.1016/J.JCSS.2010.04.007
|
|
|
Volume/pages
|
|
|
|
77
:3
(2011)
, p. 491-504
|
|
|
ISI
|
|
|
|
000288474800004
|
|
|
Full text (Publisher's DOI)
|
|
|
|
|
|
|
Full text (publisher's version - intranet only)
|
|
|
|
|
|