Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/2452376.2452441acmotherconferencesArticle/Chapter ViewAbstractPublication PagesedbtConference Proceedingsconference-collections
research-article

Optimizing query rewriting in ontology-based data access

Published: 18 March 2013 Publication History
  • Get Citation Alerts
  • 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.

    References

    [1]
    P. A. Bernstein and L. Haas. Information integration in the enterprise. Comm. of the ACM, 51(9):72--79, 2008.
    [2]
    A. Calì, G. Gottlob, and A. Pieris. New expressive languages for ontological query answering. In Proc. of AAAI 2011, pages 1541--1546, 2011.
    [3]
    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.
    [4]
    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.
    [5]
    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.
    [6]
    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.
    [7]
    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.
    [8]
    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.
    [9]
    G. Gottlob, G. Orsi, and A. Pieris. Ontological queries: Rewriting and optimization. In Proc. of ICDE 2011, pages 2--13, 2011.
    [10]
    A. Y. Halevy. Answering queries using views: A survey. VLDB Journal, 10(4):270--294, 2001.
    [11]
    A. Y. Halevy, A. Rajaraman, and J. Ordille. Data integration: The teenage years. In Proc. of VLDB 2006, pages 9--16, 2006.
    [12]
    G. Konstantinidis and J. L. Ambite. Scalable query rewriting: a graph-based approach. In Proc. of ACM SIGMOD, pages 97--108, 2011.
    [13]
    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.
    [14]
    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.
    [15]
    M. Lenzerini. Data integration: A theoretical perspective. In Proc. of PODS 2002, pages 233--246, 2002.
    [16]
    M. Lenzerini. Ontology-based data management. In Proc. of CIKM 2011, pages 5--6, 2011.
    [17]
    A. Y. Levy, A. O. Mendelzon, Y. Sagiv, and D. Srivastava. Answering queries using views. In Proc. of PODS'95, pages 95--104, 1995.
    [18]
    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.
    [19]
    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.
    [20]
    R. Pottinger and A. Y. Halevy. MiniCon: A scalable algorithm for answering queries using views. VLDB Journal, 10(2--3):182--198, 2001.
    [21]
    A. Riazanov and A. Voronkov. The design and implementation of VAMPIRE. AI Communications, 15(2--3):91--110, 2002.
    [22]
    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.
    [23]
    M. Rodriguez-Muro and D. Calvanese. High performance query answering over DL-Lite ontologies. In Proc. of KR 2012, pages 308--318, 2012.
    [24]
    R. Rosati and A. Almatelli. Improving query answering over DL-Lite ontologies. In Proc. of KR 2010, pages 290--300, 2010.
    [25]
    J. D. Ullman. Information integration using logical views. Theoretical Computer Science, 239(2):189--210, 2000.

    Cited By

    View all
    • (2023)Optimizing SPARQL Queries with SHACLThe Semantic Web – ISWC 202310.1007/978-3-031-47240-4_3(41-60)Online publication date: 27-Oct-2023
    • (2021)Improving Ocean Data Services with Semantics and Quick IndexJournal of Computer Science and Technology10.1007/s11390-021-1374-036:5(963-984)Online publication date: 30-Sep-2021
    • (2020)Using Feature-Based Description Logics to avoid Duplicate Elimination in Object-Relational Query LanguagesKI - Künstliche Intelligenz10.1007/s13218-020-00666-7Online publication date: 17-Jul-2020
    • Show More Cited By

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Other conferences
    EDBT '13: Proceedings of the 16th International Conference on Extending Database Technology
    March 2013
    793 pages
    ISBN:9781450315975
    DOI:10.1145/2452376
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 18 March 2013

    Permissions

    Request permissions for this article.

    Check for updates

    Qualifiers

    • Research-article

    Funding Sources

    Conference

    EDBT/ICDT '13

    Acceptance Rates

    Overall Acceptance Rate 7 of 10 submissions, 70%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)8
    • Downloads (Last 6 weeks)0

    Other Metrics

    Citations

    Cited By

    View all
    • (2023)Optimizing SPARQL Queries with SHACLThe Semantic Web – ISWC 202310.1007/978-3-031-47240-4_3(41-60)Online publication date: 27-Oct-2023
    • (2021)Improving Ocean Data Services with Semantics and Quick IndexJournal of Computer Science and Technology10.1007/s11390-021-1374-036:5(963-984)Online publication date: 30-Sep-2021
    • (2020)Using Feature-Based Description Logics to avoid Duplicate Elimination in Object-Relational Query LanguagesKI - Künstliche Intelligenz10.1007/s13218-020-00666-7Online publication date: 17-Jul-2020
    • (2019)VIGSemantic Web10.3233/SW-18033610:2(413-433)Online publication date: 1-Jan-2019
    • (2019)Virtual Knowledge Graphs: An Overview of Systems and Use CasesData Intelligence10.1162/dint_a_000111:2(201-223)Online publication date: May-2019
    • (2019)Crowd Sourced Semantic Enrichment (CroSSE) for knowledge driven querying of digital resourcesJournal of Intelligent Information Systems10.1007/s10844-019-00559-8Online publication date: 25-Jul-2019
    • (2018)Ontology-based data accessProceedings of the 27th International Joint Conference on Artificial Intelligence10.5555/3304652.3304791(5511-5519)Online publication date: 13-Jul-2018
    • (2018)Contextually-Enriched Querying of Integrated Data Sources2018 IEEE 34th International Conference on Data Engineering Workshops (ICDEW)10.1109/ICDEW.2018.00008(9-16)Online publication date: Apr-2018
    • (2017)The Complexity of Ontology-Based Data Access with OWL 2 QL and Bounded Treewidth QueriesProceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3034786.3034791(201-216)Online publication date: 9-May-2017
    • (2017)Cost-Driven Ontology-Based Data AccessThe Semantic Web – ISWC 201710.1007/978-3-319-68288-4_27(452-470)Online publication date: 4-Oct-2017
    • Show More Cited By

    View Options

    Get Access

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media