On propagation of deletions and annotations through views
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
A Polygen Model for Heterogeneous Database Systems: The Source Tagging Perspective
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
DBNotes: a post-it system for relational databases based on provenance
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
MONDRIAN: Annotating and Querying Databases through Colors and Blocks
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Annotation propagation revisited for key preserving views
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
On the expressiveness of implicit provenance in query and update languages
ICDT'07 Proceedings of the 11th international conference on Database Theory
iMONDRIAN: a visual tool to annotate and query scientific databases
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the expressiveness of implicit provenance in query and update languages
ACM Transactions on Database Systems (TODS)
Supporting annotations on relations
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Provenance in Databases: Why, How, and Where
Foundations and Trends in Databases
Believe it or not: adding belief annotations to databases
Proceedings of the VLDB Endowment
Coloring RDF Triples to Capture Provenance
ISWC '09 Proceedings of the 8th International Semantic Web Conference
| Hi-index | 0.01 |
Annotated relational databases can be queried either by simply xmaking 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.