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

  • Authors:

  • Diego Calvanese;Giuseppe De Giacomo;Maurizio Lenzerini;Riccardo Rosati

  • Affiliations:

  • KRDB Research Centre for Knowledge and Data, Free University of Bozen-Bolzano, Piazza Domenicani 3, I-39100 Bolzano, Italy;Dipartimento di Informatica e Sistemistica, Sapienza Universití di Roma, Via Ariosto 25, I-00185 Roma, Italy;Dipartimento di Informatica e Sistemistica, Sapienza Universití di Roma, Via Ariosto 25, I-00185 Roma, Italy;Dipartimento di Informatica e Sistemistica, Sapienza Universití di Roma, Via Ariosto 25, I-00185 Roma, Italy

  • Venue:
  • Journal of Computer and System Sciences
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

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.