Optimizing query rewriting in ontology-based data access

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 rewrit-ing of the query). In this paper we present a new approach to the optimization of query rewriting in OBDA. The key ideas of our ap-proach 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 rewrit-ing. We have experimented PerfectMap in a real-world OBDA scenario: our experimental results clearly show that, in such a sce-nario, the optimizations of PerfectMap are crucial to effectively perform query answering. 1