Ontological Query Answering via Rewriting

Georg Gottlob, Giorgio Orsi, Andreas Pieris

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

Ontological databases extend traditional databases with ontological constraints. This technology is crucial for many applications such as semantic data publishing and integration as well as model-driven database design. For many classes of ontological constraints, query answering can be solved via query rewriting. In particular, given a conjunctive query and a set of ontological constraints, the query is compiled into a first-order query, called the perfect rewriting, that encodes the intensional knowledge implied by the constraints. Then, for every database D, the answer is obtained by directly evaluating the perfect rewriting over D. Since first-order queries can be easily translated into SQL, ontological query answering can be delegated to traditional DBMSs. This allows us to utilize all the query optimization techniques available in the underlying DBMS. This paper surveys current approaches to rewriting-based query answering of ontological databases.
Original languageEnglish
Title of host publicationAdvances in Databases and Information Systems - 15th International Conference, ADBIS 2011, Vienna, Austria, September 20-23, 2011. Proceedings
PublisherSpringer Berlin Heidelberg
Number of pages18
ISBN (Electronic)978-3-642-23737-9
ISBN (Print)978-3-642-23736-2
Publication statusPublished - 2011

Publication series

NameLecture Notes in Computer Science (LNCS)
Publisher Springer Berlin Heidelberg
ISSN (Print)0302-9743


Dive into the research topics of 'Ontological Query Answering via Rewriting'. Together they form a unique fingerprint.

Cite this