The implication problem for functional and inclusion dependencies
Information and Control
A Proof Procedure for Data Dependencies
Journal of the ACM (JACM)
On conjunctive queries containing inequalities
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 a subclass of conjunctive queries
Acta Informatica
Answering queries using views (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Complexity of answering queries using materialized views
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The theory of joins in relational databases
ACM Transactions on Database Systems (TODS)
Efficient optimization of a class of relational expressions
ACM Transactions on Database Systems (TODS)
Testing implications of data dependencies
ACM Transactions on Database Systems (TODS)
Equivalences Among Relational Expressions with the Union and Difference Operators
Journal of the ACM (JACM)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Testing containment of conjunctive queries under functional and inclusion dependencies
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
The Implication Problem for Data Dependencies
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Embedded implicational dependencies and their inference problem
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Data exchange: getting to the core
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Data exchange: semantics and query answering
Theoretical Computer Science - Database theory
Theory of Relational Databases
Theory of Relational Databases
Query reformulation with constraints
ACM SIGMOD Record
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
Repair checking in inconsistent databases: algorithms and complexity
Proceedings of the 12th International Conference on Database Theory
Computing certain answers in the presence of dependencies
Information Systems
Datalog+/-: A Family of Logical Knowledge Representation and Query Languages for New Applications
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Chase termination: a constraints rewriting approach
Proceedings of the VLDB Endowment
Scalable query rewriting: a graph-based approach
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
A logical toolbox for ontological reasoning
ACM SIGMOD Record
Optimizing query rewriting for multiple queries
Proceedings of the Ninth International Workshop on Information Integration on the Web
Incomplete Data and Data Dependencies in Relational Databases
Incomplete Data and Data Dependencies in Relational Databases
Hi-index | 0.00 |
We consider the problem of query containment under ontological constraints, such as those of RDFS. Query containment, i.e., deciding whether the answers of a given query are always contained in the answers of another query, is an important problem to areas such as database theory and knowledge representation, with applications to data integration, query optimization and minimization. We consider unions of conjunctive queries, which constitute the core of structured query languages, such as SPARQL and SQL. We also consider ontological constraints or axioms, expressed in the language of Tuple-Generating Dependencies. TGDs capture RDF/S and fragments of Description Logics. We consider classes of TGDs for which the chase is known to terminate. Query containment under chase-terminating axioms can be decided by first running the chase on one of the two queries and then rely on classic relational containment. When considering unions of conjunctive queries, classic algorithms for both the chase and containment phases suffer from a large degree of redundancy. We leverage a graph-based modeling of rules, that represents multiple queries in a compact form, by exploiting shared patterns amongst them. As a result we couple the phases of both for chase and regular containment and end up with a faster and more scalable algorithm. Our experiments show a speedup of close to two orders of magnitude.