Classification of annotation semirings over query containment
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Combining dependent annotations for relational algebra
Proceedings of the 15th International Conference on Database Theory
Semiring-annotated data: queries and provenance?
ACM SIGMOD Record
ACM Transactions on Database Systems (TODS)
Meta programming with answer sets for smart spaces
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
Proceedings of the 16th International Conference on Database Theory
Containment of pattern-based queries over data trees
Proceedings of the 16th International Conference on Database Theory
Classification of annotation semirings over containment of conjunctive queries
ACM Transactions on Database Systems (TODS)
Hi-index | 0.00 |
We study containment and equivalence of (unions of) conjunctive queries on relations annotated with elements of a commutative semiring. Such relations and the semantics of positive relational queries on them were introduced in a recent paper as a generalization of set semantics, bag semantics, incomplete databases, and databases annotated with various kinds of provenance information. We obtain positive decidability results and complexity characterizations for databases with lineage, why-provenance, and provenance polynomial annotations, for both conjunctive queries and unions of conjunctive queries. At least one of these results is surprising given that provenance polynomial annotations seem “more expressive” than bag semantics and under the latter, containment of unions of conjunctive queries is known to be undecidable. The decision procedures rely on interesting variations on the notion of containment mappings. We also show that for any positive semiring (a very large class) and conjunctive queries without self-joins, equivalence is the same as isomorphism.