Incomplete Information in Relational Databases
Journal of the ACM (JACM)
On the equivalence of recursive and nonrecursive datalog programs
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Optimization of real conjunctive queries
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Equivalence of datalog queries is undecidable
Journal of Logic Programming
The graph isomorphism problem: its structural complexity
The graph isomorphism problem: its structural complexity
Containment of conjunctive queries: beyond relations as sets
ACM Transactions on Database Systems (TODS)
A probabilistic relational algebra for the integration of information retrieval and database systems
ACM Transactions on Information Systems (TOIS)
Query evaluation in probabilistic relational databases
Selected papers from the international workshop on Uncertainty in databases and deductive systems
Deciding equivalences among aggregate queries
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Rewriting aggregate queries using views
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Equivalences Among Relational Expressions with the Union and Difference Operators
Journal of the ACM (JACM)
Tracing the lineage of view data in a warehousing environment
ACM Transactions on Database Systems (TODS)
On propagation of deletions and annotations through views
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A Parametric Approach to Deductive Databases with Uncertainty
IEEE Transactions on Knowledge and Data Engineering
Semantics and Containment with Internal and External Conjunctions
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Semirings for Soft Constraint Solving and Programming (LECTURE NOTES IN COMPUTER SCIENCE)
Semirings for Soft Constraint Solving and Programming (LECTURE NOTES IN COMPUTER SCIENCE)
Equivalences among aggregate queries with negation
ACM Transactions on Computational Logic (TOCL)
Containment of aggregate queries
ACM SIGMOD Record
Equivalence of queries combining set and bag-set semantics
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The containment problem for Real conjunctive queries with inequalities
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
From complete to incomplete information and back
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the complexity of managing probabilistic XML data
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Update exchange with mappings and provenance
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Annotated XML: queries and provenance
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the 12th International Conference on Database Theory
Exploiting Lineage for Confidence Computation in Uncertain and Probabilistic Databases
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Proceedings of the 12th International Conference on Database Theory
Provenance in Databases: Why, How, and Where
Foundations and Trends in Databases
Knowledge compilation meets database theory: compiling queries to decision diagrams
Proceedings of the 14th International Conference on Database Theory
Provenance for aggregate queries
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Putting lipstick on pig: enabling database-style workflow provenance
Proceedings of the VLDB Endowment
ACM Transactions on Database Systems (TODS)
Algebraic structures for capturing the provenance of SPARQL queries
Proceedings of the 16th International Conference on Database Theory
| 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.