Polynomial conjunctive query rewriting under unary inclusion dependencies

  • Authors:

  • Stanislav Kikot;Roman Kontchakov;Michael Zakharyaschev

  • Affiliations:

  • Department of Computer Science and Information Systems, Birkbeck College, London;Department of Computer Science and Information Systems, Birkbeck College, London;Department of Computer Science and Information Systems, Birkbeck College, London

  • Venue:
  • RR'11 Proceedings of the 5th international conference on Web reasoning and rule systems
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Ontology-based data access (OBDA) is widely accepted as an important ingredient of the new generation of information systems. In the OBDA paradigm, potentially incomplete relational data is enriched by means of ontologies, representing intensional knowledge of the application domain. We consider the problem of conjunctive query answering in OBDA. Certain ontology languages have been identified as FO-rewritable (e.g., DL-Lite and sticky-join sets of TGDs), which means that the ontology can be incorporated into the user's query, thus reducing OBDA to standard relational query evaluation. However, all known query rewriting techniques produce queries that are exponentially large in the size of the user's query, which can be a serious issue for standard relational database engines. In this paper, we present a polynomial query rewriting for conjunctive queries under unary inclusion dependencies. On the other hand, we show that binary inclusion dependencies do not admit polynomial query rewriting algorithms.