Floriana Di Pinto
Domenico Fabio Savo
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.
- P. A. Bernstein and L. Haas. Information integration in the enterprise. Comm. of the ACM, 51(9):72--79, 2008. Google Scholar
Digital Library
- A. Calì, G. Gottlob, and A. Pieris. New expressive languages for ontological query answering. In Proc. of AAAI 2011, pages 1541--1546, 2011.Google Scholar
- A. Calì, D. Lembo, and R. Rosati. Query rewriting and answering under constraints in data integration systems. In Proc. of IJCAI 2003, pages 16--21, 2003. Google ScholarDigital Library
- D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, A. Poggi, M. Rodriguez-Muro, R. Rosati, M. Ruzzi, and D. F. Savo. The Mastro system for ontology-based data access. Semantic Web J., 2(1):43--53, 2011. Google ScholarCross Ref
- D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, and R. Rosati. Tractable reasoning and efficient query answering in description logics: The DL-Lite family. J. of Automated Reasoning, 39(3):385--429, 2007. Google ScholarDigital Library
- D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, and R. Rosati. Conceptual modeling for data integration. In A. T. Borgida, V. Chaudhri, P. Giorgini, and E. Yu, editors, Conceptual Modeling: Foundations and Applications -- Essays in Honor of John Mylopoulos, volume 5600 of LNCS, pages 173--197. Springer, 2009. Google ScholarDigital Library
- D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, and R. Rosati. Data complexity of query answering in description logics. Artificial Intelligence, 2012. To appear. Google ScholarDigital Library
- O. M. Duschka, M. R. Genesereth, and A. Y. Levy. Recursive query plans for data integration. J. of Logic Programming, 43(1):49--73, 2000.Google ScholarCross Ref
- G. Gottlob, G. Orsi, and A. Pieris. Ontological queries: Rewriting and optimization. In Proc. of ICDE 2011, pages 2--13, 2011. Google ScholarDigital Library
- A. Y. Halevy. Answering queries using views: A survey. VLDB Journal, 10(4):270--294, 2001. Google ScholarDigital Library
- A. Y. Halevy, A. Rajaraman, and J. Ordille. Data integration: The teenage years. In Proc. of VLDB 2006, pages 9--16, 2006. Google ScholarDigital Library
- G. Konstantinidis and J. L. Ambite. Scalable query rewriting: a graph-based approach. In Proc. of ACM SIGMOD, pages 97--108, 2011. Google ScholarDigital Library
- R. Kontchakov, C. Lutz, D. Toman, F. Wolter, and M. Zakharyaschev. The combined approach to query answering in DL-Lite. In Proc. of KR 2010, pages 247--257, 2010.Google Scholar
- W. Le, S. Duan, A. Kementsietsidis, F. Li, and M. Wang. Rewriting queries on SPARQL views. In Proc. of WWW 2011, pages 655--664, 2011. Google ScholarDigital Library
- M. Lenzerini. Data integration: A theoretical perspective. In Proc. of PODS 2002, pages 233--246, 2002. Google ScholarDigital Library
- M. Lenzerini. Ontology-based data management. In Proc. of CIKM 2011, pages 5--6, 2011. Google ScholarDigital Library
- A. Y. Levy, A. O. Mendelzon, Y. Sagiv, and D. Srivastava. Answering queries using views. In Proc. of PODS'95, pages 95--104, 1995. Google ScholarDigital Library
- H. Pérez-Urbina, B. Motik, and I. Horrocks. Tractable query answering and rewriting under description logic constraints. J. of Applied Logic, 8(2):186--209, 2010.Google ScholarCross Ref
- A. Poggi, D. Lembo, D. Calvanese, G. De Giacomo, M. Lenzerini, and R. Rosati. Linking data to ontologies. J. on Data Semantics, X:133--173, 2008. Google Scholar
- R. Pottinger and A. Y. Halevy. MiniCon: A scalable algorithm for answering queries using views. VLDB Journal, 10(2--3):182--198, 2001. Google ScholarDigital Library
- A. Riazanov and A. Voronkov. The design and implementation of VAMPIRE. AI Communications, 15(2--3):91--110, 2002. Google ScholarDigital Library
- M. Rodríguez-Muro and D. Calvanese. Dependencies: Making ontology based data access work in practice. In Proc. of AMW 2011, volume 749 of CEUR, ceur-ws.org, 2011.Google Scholar
- M. Rodriguez-Muro and D. Calvanese. High performance query answering over DL-Lite ontologies. In Proc. of KR 2012, pages 308--318, 2012.Google Scholar
- R. Rosati and A. Almatelli. Improving query answering over DL-Lite ontologies. In Proc. of KR 2010, pages 290--300, 2010.Google Scholar
- J. D. Ullman. Information integration using logical views. Theoretical Computer Science, 239(2):189--210, 2000. Google ScholarDigital Library
Index Terms
- Optimizing query rewriting in ontology-based data access
Recommendations
Ontology-Based Data Access: A Study through Disjunctive Datalog, CSP, and MMSNP
Invited Articles Issue, SIGMOD 2013, PODS 2013 and ICDT 2013Ontology-based data access is concerned with querying incomplete data sources in the presence of domain-specific knowledge provided by an ontology. A central notion in this setting is that of an ontology-mediated query, which is a database query coupled ...
Ontology-based data access: a study through disjunctive datalog, CSP, and MMSNP
PODS '13: Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of database systemsOntology-based data access is concerned with querying incomplete data sources in the presence of domain-specific knowledge provided by an ontology. A central notion in this setting is that of an ontology-mediated query, which is a database query coupled ...
The price of query rewriting in ontology-based data access
We give a solution to the succinctness problem for the size of first-order rewritings of conjunctive queries in ontology-based data access with ontology languages such as OWL 2 QL, linear Datalog± and sticky Datalog±. We show that positive existential ...
Comments