Ontological Query Answering via Rewriting

Ontological databases extend traditional databases with ontological constraints. This technology is crucial for many applications such as semantic data publishing and integration as well as model-driven database design. For many classes of ontological constraints, query answering can be solved via query rewriting. In particular, given a conjunctive query and a set of ontological constraints, the query is compiled into a first-order query, called the perfect rewriting, that encodes the intensional knowledge implied by the constraints. Then, for every database D, the answer is obtained by directly evaluating the perfect rewriting over D. Since first-order queries can be easily translated into SQL, ontological query answering can be delegated to traditional DBMSs. This allows us to utilize all the query optimization techniques available in the underlying DBMS. This paper surveys current approaches to rewriting-based query answering of ontological databases.

[1]  Christos H. Papadimitriou,et al.  Computational complexity , 1993 .

[2]  R. Smullyan.  First-Order Logic , 1968 .

[3]  Moshe Y. Vardi.  On the Complexity of Bounded-Variable Queries. , 1995, PODS 1995.

[4]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

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

[6]  Andrea Calì,et al.  Query Answering under Expressive Entity-Relationship Schemata , 2010, ER.

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

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

[9]  Jean-François Baget,et al.  On rules with existential variables: Walking the decidability line , 2011, Artif. Intell..

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

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

[12]  Alberto H. F. Laender.  Conceptual Modeling - ER 2009, 28th International Conference on Conceptual Modeling, Gramado, Brazil, November 9-12, 2009. Proceedings , 2009, ER.

[13]  Moshe Y. Vardi.  On the complexity of bounded-variable queries (extended abstract) , 1995, PODS '95.

[14]  Yuri Gurevich,et al.  Datalog vs. first-order logic , 1989, 30th Annual Symposium on Foundations of Computer Science.

[15]  Andrea Calì,et al.  Tractable Query Answering over Conceptual Schemata , 2009, ER.

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

[17]  William H. Joyner.  Resolution Strategies as Decision Procedures , 1976, JACM.

[18]  Eugene Inseok Chong,et al.  An Efficient SQL-based RDF Querying Scheme , 2005, VLDB.

[19]  Laks V. S. Lakshmanan,et al.  Selected papers from the Logic in Databases Workshop 2008 , 2010, J. Appl. Log..

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

[21]  Carsten Lutz,et al.  The Combined Approach to Query Answering in DL-Lite , 2010, KR.

[22]  Giorgio Orsi,et al.  Optimizing query answering under ontological constraints , 2011, Proc. VLDB Endow..

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

[24]  Thomas Schwentick,et al.  Rewriting Ontological Queries into Small Nonrecursive Datalog Programs , 2011, Description Logics.

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

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

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

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

[29]  Barry Bishop,et al.  OWLIM: A family of scalable semantic repositories , 2011, Semantic Web.

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

[31]  Peretz Shoval,et al.  Conceptual Modeling - ER 2010, 29th International Conference on Conceptual Modeling, Vancouver, BC, Canada, November 1-4, 2010. Proceedings , 2010, ER.

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

[33]  Andrea Calì,et al.  Query rewriting and answering under constraints in data integration systems , 2003, IJCAI.

[34]  Diego Calvanese,et al.  The DL-Lite Family and Relations , 2009, J. Artif. Intell. Res..

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

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

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

[38]  Diego Calvanese,et al.  Data Complexity of Query Answering in Description Logics , 2006, Description Logics.