Optimizing query rewriting in ontology-based data access

  • Authors:
  • Floriana Di Pinto;Domenico Lembo;Maurizio Lenzerini;Riccardo Mancini;Antonella Poggi;Riccardo Rosati;Marco Ruzzi;Domenico Fabio Savo

  • Affiliations:
  • DIAG, Sapienza Università di Roma;DIAG, Sapienza Università di Roma;DIAG, Sapienza Università di Roma;DIAG, Sapienza Università di Roma;DIAG, Sapienza Università di Roma;DIAG, Sapienza Università di Roma;DIAG, Sapienza Università di Roma;DIAG, Sapienza Università di Roma

  • Venue:
  • Proceedings of the 16th International Conference on Extending Database Technology
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

In ontology-based data access (OBDA), an ontology is connected to autonomous, and generally pre-existing, data repositories through mappings, so as to provide a high-level, conceptual view over such data. User queries are posed over the ontology, and answers are computed by reasoning both on the ontology and the mappings. Query answering in OBDA systems is typically performed through a query rewriting approach which is divided into two steps: (i) the query is rewritten with respect to the ontology (ontology rewriting of the query); (ii) the query thus obtained is then reformulated over the database schema using the mapping assertions (mapping rewriting of the query). In this paper we present a new approach to the optimization of query rewriting in OBDA. The key ideas of our approach are the usage of inclusion between mapping views and the usage of perfect mappings, which allow us to drastically lower the combinatorial explosion due to mapping rewriting. These ideas are formalized in PerfectMap, an algorithm for OBDA query rewriting. We have experimented PerfectMap in a real-world OBDA scenario: our experimental results clearly show that, in such a scenario, the optimizations of PerfectMap are crucial to effectively perform query answering.