Optimizing query rewriting in ontology-based data access. Pinto, F. D., Lembo, D., Lenzerini, M., Mancini, R., Poggi, A., Rosati, R., Ruzzi, M., Savo, & Fabio, D. In Guerrini, G. & Paton, N. W., editors, EDBT, pages 561-572, 2013. ACM. abstract bibtex 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.
@inproceedings{ dipinto2013edbt,
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.},
added-at = {2014-06-02T12:33:58.000+0200},
audience = {academic},
author = {Di Pinto, Floriana and Lembo, Domenico and Lenzerini, Maurizio and Mancini, Riccardo and Poggi, Antonella and Rosati, Riccardo and Ruzzi, Marco and Savo, Domenico Fabio},
biburl = {http://www.bibsonomy.org/bibtex/21e8e06a83286c67b6853e84db02800e2/savo.fabio},
booktitle = {EDBT},
editor = {Guerrini, Giovanna and Paton, Norman W.},
interhash = {bbf0edbb5552955fa19f44de9f567bbd},
intrahash = {1e8e06a83286c67b6853e84db02800e2},
keywords = {myown optique-project},
pages = {561-572},
partneroptique = {UNIROMA1},
publisher = {ACM},
title = {Optimizing query rewriting in ontology-based data access.},
wpoptique = {WP4},
year = {2013},
yearoptique = {Y1}
}
Downloads: 0
{"_id":{"_str":"538836350e577e1d6b002d6d"},"__v":0,"authorIDs":[],"author_short":["Pinto, F.<nbsp>D.","Lembo, D.","Lenzerini, M.","Mancini, R.","Poggi, A.","Rosati, R.","Ruzzi, M.","Savo","Fabio, D."],"bibbaseid":"pinto-lembo-lenzerini-mancini-poggi-rosati-ruzzi-savo-fabio-optimizingqueryrewritinginontologybaseddataaccess-2013","bibdata":{"downloads":0,"keyword":["myown optique-project"],"bibbaseid":"pinto-lembo-lenzerini-mancini-poggi-rosati-ruzzi-savo-fabio-optimizingqueryrewritinginontologybaseddataaccess-2013","urls":{},"role":"author","yearoptique":"Y1","year":"2013","wpoptique":"WP4","type":"inproceedings","title":"Optimizing query rewriting in ontology-based data access.","publisher":"ACM","partneroptique":"UNIROMA1","pages":"561-572","keywords":"myown optique-project","key":"dipinto2013edbt","intrahash":"1e8e06a83286c67b6853e84db02800e2","interhash":"bbf0edbb5552955fa19f44de9f567bbd","id":"dipinto2013edbt","editor_short":["Guerrini, G.","Paton, N.<nbsp>W."],"editor":["Guerrini, Giovanna","Paton, Norman W."],"booktitle":"EDBT","biburl":"http://www.bibsonomy.org/bibtex/21e8e06a83286c67b6853e84db02800e2/savo.fabio","bibtype":"inproceedings","bibtex":"@inproceedings{ dipinto2013edbt,\n abstract = {In ontology-based data access (OBDA), an ontology is connected to\r\nautonomous, and generally pre-existing, data repositories through\r\nmappings, so as to provide a high-level, conceptual view over such\r\ndata. User queries are posed over the ontology, and answers are\r\ncomputed by reasoning both on the ontology and the mappings.\r\nQuery answering in OBDA systems is typically performed through\r\na query rewriting approach which is divided into two steps: (i) the\r\nquery is rewritten with respect to the ontology (ontology rewriting\r\nof the query); (ii) the query thus obtained is then reformulated over\r\nthe database schema using the mapping assertions (mapping rewriting of the query). In this paper we present a new approach to the\r\noptimization of query rewriting in OBDA. The key ideas of our approach are the usage of inclusion between mapping views and the\r\nusage of perfect mappings, which allow us to drastically lower the\r\ncombinatorial explosion due to mapping rewriting. These ideas are\r\nformalized in PerfectMap, an algorithm for OBDA query rewriting. We have experimented PerfectMap in a real-world OBDA\r\nscenario: our experimental results clearly show that, in such a scenario, the optimizations of PerfectMap are crucial to effectively\r\nperform query answering.},\n added-at = {2014-06-02T12:33:58.000+0200},\n audience = {academic},\n author = {Di Pinto, Floriana and Lembo, Domenico and Lenzerini, Maurizio and Mancini, Riccardo and Poggi, Antonella and Rosati, Riccardo and Ruzzi, Marco and Savo, Domenico Fabio},\n biburl = {http://www.bibsonomy.org/bibtex/21e8e06a83286c67b6853e84db02800e2/savo.fabio},\n booktitle = {EDBT},\n editor = {Guerrini, Giovanna and Paton, Norman W.},\n interhash = {bbf0edbb5552955fa19f44de9f567bbd},\n intrahash = {1e8e06a83286c67b6853e84db02800e2},\n keywords = {myown optique-project},\n pages = {561-572},\n partneroptique = {UNIROMA1},\n publisher = {ACM},\n title = {Optimizing query rewriting in ontology-based data access.},\n wpoptique = {WP4},\n year = {2013},\n yearoptique = {Y1}\n}","author_short":["Pinto, F.<nbsp>D.","Lembo, D.","Lenzerini, M.","Mancini, R.","Poggi, A.","Rosati, R.","Ruzzi, M.","Savo","Fabio, D."],"author":["Pinto, Floriana Di","Lembo, Domenico","Lenzerini, Maurizio","Mancini, Riccardo","Poggi, Antonella","Rosati, Riccardo","Ruzzi, Marco","Savo","Fabio, Domenico"],"audience":"academic","added-at":"2014-06-02T12:33:58.000+0200","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."},"bibtype":"inproceedings","biburl":"http://www.bibsonomy.org/bib/search/optique-project?bibtex.entriesPerPage=10000","downloads":0,"keywords":["myown optique-project"],"search_terms":["optimizing","query","rewriting","ontology","based","data","access","pinto","lembo","lenzerini","mancini","poggi","rosati","ruzzi","savo","fabio"],"title":"Optimizing query rewriting in ontology-based data access.","year":2013,"dataSources":["tYYCZGwzkJatkJPTa"]}