Optimizing query answering under ontological constraints

Ontological queries are evaluated against a database combined with ontological constraints. Answering such queries is a challenging new problem for database research. For many ontological modelling languages, query answering can be solved via query rewriting: given a conjunctive query and an ontology, the query can be transformed into a first-order query, called the perfect rewriting, that takes into account the semantic consequences of the ontology. Then, for every extensional database D, the answer to the query is obtained by evaluating the rewritten query against D. In this paper we present a new algorithm that computes the perfect rewriting of a conjunctive query w.r.t. a linear Datalog± ontology. Also, we provide an experimental comparison of our algorithm with existing rewriting techniques.

[1]  Ronald Fagin,et al.  Data exchange: semantics and query answering , 2003, Theor. Comput. Sci..

[2]  Andrea Calì,et al.  Query Rewriting under Non-Guarded Rules , 2010, AMW.

[3]  Andrea Calì,et al.  A general datalog-based framework for tractable query answering over ontologies , 2009, SEBD.

[4]  Andrea Calì,et al.  Query Answering under Non-guarded Rules in Datalog+/- , 2010, RR.

[5]  Diego Calvanese,et al.  Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family , 2007, Journal of Automated Reasoning.

[6]  Letizia Tanca,et al.  Semantic Web Information Management - A Model-Based Perspective , 2009, Semantic Web Information Management.

[7]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[8]  Andrea Calì,et al.  Taming the Infinite Chase: Query Answering under Expressive Relational Constraints , 2008, Description Logics.

[9]  Alin Deutsch,et al.  The chase revisited , 2008, PODS.

[10]  David S. Johnson,et al.  Testing containment of conjunctive queries under functional and inclusion dependencies , 1982, J. Comput. Syst. Sci..

[11]  Haim Gaifman,et al.  Decidable Optimization Problems for Database Logic Programs (Preliminary Report) , 1988, STOC 1988.

[12]  David Maier,et al.  Testing implications of data dependencies , 1979, SIGMOD '79.

[13]  Riccardo Rosati,et al.  Improving Query Answering over DL-Lite Ontologies , 2010, KR.

[14]  Harry G. Mairson,et al.  Undecidable optimization problems for database logic programs , 1993, JACM.

[15]  Diego Calvanese,et al.  Linking Data to Ontologies , 2008, J. Data Semant..

[16]  Boris Motik,et al.  Tractable query answering and rewriting under description logic constraints , 2010, J. Appl. Log..

[17]  Catriel Beeri,et al.  The Implication Problem for Data Dependencies , 1981, ICALP.

[18]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[19]  Andrea Calì,et al.  Advanced processing for ontological queries , 2010, Proc. VLDB Endow..

[20]  Giorgio Orsi,et al.  Ontological queries: Rewriting and optimization , 2011, 2011 IEEE 27th International Conference on Data Engineering.

[21]  Luca Cabibbo,et al.  The Expressive Power of Stratified Logic Programs with Value Invention , 1998, Inf. Comput..