Ontological queries: Rewriting and optimization

Ontological queries are evaluated against an enterprise ontology rather than directly on a database. The evaluation and optimization of such queries is an intriguing new problem for database research. In this paper we discuss two important aspects of this problem: query rewriting and query optimization. Query rewriting consists of the compilation of an ontological query into an equivalent query against the underlying relational database. The focus here is on soundness and completeness. We review previous results and present a new rewriting algorithm for rather general types of ontological constraints (description logics). In particular, we show how a conjunctive query (CQ) against an enterprise ontology can be compiled into a union of conjunctive queries (UCQ) against the underlying database. Ontological query optimization, in this context, attempts to improve this process so to produce possibly small and cost-effective output UCQ. We review existing optimization methods, and propose an effective new method that works for Linear Datalog±, a description logic that encompasses well-known description logics of the DL-Lite family.

[1]  Alin Deutsch,et al.  Query reformulation with constraints , 2006, SGMD.

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

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

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

[5]  Alon Y. Halevy,et al.  Answering queries using views: A survey , 2001, The VLDB Journal.

[6]  Vassilis Christophides,et al.  The ICS-FORTH RDFSuite: Managing Voluminous RDF Description Bases , 2001, SemWeb.

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

[8]  Boris Motik,et al.  Efficient Query Answering for OWL 2 , 2009, SEMWEB.

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

[10]  Moshe Y. Vardi,et al.  The Implication Problem for Functional and Inclusion Dependencies is Undecidable , 1985, SIAM J. Comput..

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

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

[13]  Franz Baader,et al.  How Pervasive Is the Myerson-Satterthwaite Impossibility? , 2009, IJCAI.

[14]  Ashok K. Chandra,et al.  Optimal implementation of conjunctive queries in relational data bases , 1977, STOC '77.

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

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

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

[18]  Bruno Marnette,et al.  Generalized schema-mappings: from termination to tractability , 2009, PODS.

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

[20]  Georg Gottlob,et al.  Datalog±: a unified approach to ontologies and integrity constraints , 2009, ICDT '09.

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

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

[23]  Alin Deutsch,et al.  MARS: A System for Publishing XML from Mixed and Redundant Storage , 2003, VLDB.

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

[25]  Andrea Calì,et al.  On the decidability and complexity of query answering over inconsistent and incomplete databases , 2003, PODS.

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

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

[28]  Letizia Tanca,et al.  What you Always Wanted to Know About Datalog (And Never Dared to Ask) , 1989, IEEE Trans. Knowl. Data Eng..

[29]  Thomas R. Gruber,et al.  A translation approach to portable ontology specifications , 1993, Knowl. Acquis..

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

[31]  Michael Uschold,et al.  The Enterprise Ontology , 1998, The Knowledge Engineering Review.

[32]  Catriel Beeri,et al.  A Proof Procedure for Data Dependencies , 1984, JACM.

[33]  Georg Gottlob,et al.  Hypertree decompositions and tractable queries , 1998, J. Comput. Syst. Sci..