The Combined Approach to Query Answering in DL-Lite

Databases and related information systems can benefit from the use of ontologies to enrich the data with general background knowledge. The DL-Lite family of ontology languages was specifically tailored towards such ontology-based data access, enabling an implementation in a relational database management system (RDBMS) based on a query rewriting approach. In this paper, we propose an alternative approach to implementing ontology-based data access in DL-Lite.The distinguishing feature of our approach is to allow rewriting of both the query and the data. We show that, in contrast to the existing approaches, no exponential blowup is produced by the rewritings. Based on experiments with a number of real-world ontologies, we demonstrate that query execution in the proposed approach is often more efficient than in existing approaches, especially for large ontologies. We also show how to seamlessly integrate the data rewriting step of our approach into an RDBMS using views (which solves the update problem) and make an interesting observation regarding the succinctness of queries in the original query rewriting approach.

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

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

[3]  Diego Calvanese,et al.  DL-Lite: Tractable Description Logics for Ontologies , 2005, AAAI.

[4]  Edith Schonberg,et al.  Ontology Reasoning with Large Data Repositories , 2008, Ontology Management.

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

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

[7]  Yevgeny Kazakov,et al.  Consequence-Driven Reasoning for Horn SHIQ Ontologies , 2009, IJCAI.

[8]  Carsten Lutz,et al.  Combined FO Rewritability for Conjunctive Query Answering in DL-Lite , 2009, Description Logics.

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

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

[11]  Diego Calvanese,et al.  Inconsistency Tolerance in P2P Data Integration: An Epistemic Logic Approach , 2005, DBPL.

[12]  Edith Schonberg,et al.  Scalable Grounded Conjunctive Query Evaluation over Large and Expressive Knowledge Bases , 2008, SEMWEB.

[13]  Diego Calvanese,et al.  The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.

[14]  Carsten Lutz,et al.  Conjunctive Query Answering in the Description Logic EL Using a Relational Database System , 2009, IJCAI.

[15]  Antonella Poggi,et al.  Ontology-based database access with DIG-Mastro and the OBDA Plugin for Protégé (Demo Description) , 2008, OWLED.

[16]  Diego Calvanese,et al.  QuOnto: Querying Ontologies , 2005, AAAI.

[17]  Markus Stocker,et al.  Owlgres: A Scalable OWL Reasoner , 2008, OWLED.

[18]  Boris Motik,et al.  A Comparison of Query Rewriting Techniques for DL-lite , 2009, Description Logics.

[19]  Diego Calvanese,et al.  The Description Logic Handbook , 2007 .

[20]  Latha S. Colby,et al.  Algorithms for deferred view maintenance , 1996, SIGMOD '96.

[21]  Robert A. Kowalski,et al.  Linear Resolution with Selection Function , 1971, Artif. Intell..