Containment of conjunctive queries on annotated relations

DOI10.1007/s00224-011-9327-6zbMath1222.68075OpenAlexW2058560220MaRDI QIDQ639858

Todd J. Green

Publication date: 11 October 2011

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://repository.upenn.edu/cgi/viewcontent.cgi?article=1049&context=db_research

zbMATH Keywords

provenancedatabase theoryquery optimization

Mathematics Subject Classification ID

Database theory (68P15) Semantics in the theory of computing (68Q55)

Related Items

A Complexity Assessment for Queries Involving Sufficient and Necessary Causes, Classification of annotation semirings over containment of conjunctive queries, Reconcilable differences, Containment of conjunctive queries on annotated relations, Provenance analysis for logic and games, The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side

Cites Work

• Unnamed Item
• Unnamed Item
• Containment of conjunctive queries on annotated relations
• Query evaluation in probabilistic relational databases
• On the equivalence of recursive and nonrecursive Datalog programs
• World-set decompositions: Expressiveness and efficient algorithms
• Semirings for constraint solving and programming.
• Deciding equivalences among conjunctive aggregate queries
• Incomplete Information in Relational Databases
• Equivalences Among Relational Expressions with the Union and Difference Operators
• Equivalence of Datalog queries is undecidable
• Equivalences among aggregate queries with negation
• Operations with structures