Optimizing Query Answering under Ontological Constraints

Giorgio Orsi, Andreas Pieris

Research output: Contribution to journalArticlepeer-review

Abstract / Description of output

Ontological queries are evaluated against a database combined with ontological constraints. Answering such queries is a challenging new problem for database research. For many ontological modelling languages, query answering can
be solved via query rewriting: given a conjunctive query and an ontology, the query can be transformed into a first-order query, called the perfect rewriting, that takes into account the semantic consequences of the ontology. Then, for every extensional database D, the answer to the query is obtained by evaluating the rewritten query against D. In this paper we present a new algorithm that computes the perfect rewriting of a conjunctive query w.r.t. a linear Datalog± ontology. Also, we provide an experimental comparison of our algorithm with existing rewriting techniques.
Original languageEnglish
Pages (from-to)1004-1015
Number of pages12
JournalProceedings of the VLDB Endowment
Issue number11
Publication statusPublished - 2011


Dive into the research topics of 'Optimizing Query Answering under Ontological Constraints'. Together they form a unique fingerprint.

Cite this