Teaching an RDBMS about ontological constraints

Abstract : In the presence of an ontology, query answers must reflect not only data explicitly present in the database, but also implicit data, which holds due to the ontology, even though it is not present in the database. A large and useful set of ontology languages enjoys FOL reducibility of query answering: answering a query can be reduced to evaluating a certain first-order logic (FOL) formula (obtained from the query and ontology) against only the explicit facts. We present a novel query optimization framework for ontology-based data access settings enjoying FOL reducibility. Our framework is based on searching within a set of alternative equivalent FOL queries, i.e., FOL reformulations, one with minimal evaluation cost when evaluated through a relational database system. We apply this framework to the DL-LiteR Description Logic underpinning the W3C's OWL2 QL ontology language, and demonstrate through experiments its performance benefits when two leading SQL systems, one open-source and one commercial, are used for evaluating the FOL query reformulations.
Type de document :
Communication dans un congrès
Very Large Data Bases, Sep 2016, New Delhi, India. 〈http://vldb2016.persistent.com/〉
Liste complète des métadonnées

Littérature citée [34 références]  Voir  Masquer  Télécharger

Contributeur : Damian Bursztyn <>
Soumis le : lundi 22 août 2016 - 14:52:40
Dernière modification le : jeudi 7 février 2019 - 14:35:50
Document(s) archivé(s) le : mercredi 23 novembre 2016 - 10:33:16


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-01354592, version 1


Damian Bursztyn, François Goasdoué, Ioana Manolescu. Teaching an RDBMS about ontological constraints. Very Large Data Bases, Sep 2016, New Delhi, India. 〈http://vldb2016.persistent.com/〉. 〈hal-01354592〉



Consultations de la notice


Téléchargements de fichiers