View-based query answering in Description Logics: Semantics and complexity

36Citations
Citations of this article
33Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

View-based query answering is the problem of answering a query based only on the precomputed answers to a set of views. While this problem has been widely investigated in databases, it is largely unexplored in the context of Description Logic ontologies. Differently from traditional databases, Description Logics may express several forms of incomplete information, and this poses challenging problems in characterizing the semantics of views. In this paper, we first present a general framework for view-based query answering, where we address the above semantical problems by providing two notions of view-based query answering over ontologies, all based on the idea that the precomputed answers to views are the certain answers to the corresponding queries. We also relate such notions to privacy-aware access to ontologies. Then, we provide decidability results, algorithms, and data complexity characterizations for view-based query answering in several Description Logics, ranging from those with limited modeling capability to highly expressive ones. © 2011 Elsevier Inc. All rights reserved.

Cite

CITATION STYLE

APA

Calvanese, D., De Giacomo, G., Lenzerini, M., & Rosati, R. (2012). View-based query answering in Description Logics: Semantics and complexity. Journal of Computer and System Sciences, 78(1), 26–46. https://doi.org/10.1016/j.jcss.2011.02.011

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free