Optimizing FOL reducible query answering - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

Optimizing FOL reducible query answering


We devise a query optimization framework for formalisms enjoying FOL reducibility of query answering, for which it reduces to the evaluation of a FOL query against facts. This framework allows 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 provide two algorithms , an exhaustive and a greedy, for exploring this space of alternatives. We apply this framework to the DL-LiteR description logic underpinning the W3C's OWL2 QL profile; an experimental evaluation validates the interest and applicability of our technique.
Fichier principal
Vignette du fichier
dlr-bda15.pdf (324.53 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01174300 , version 1 (08-07-2015)


  • HAL Id : hal-01174300 , version 1


Damian Bursztyn, François Goasdoué, Ioana Manolescu. Optimizing FOL reducible query answering. BDA'15, Sep 2015, Île de Porquerolles, France. ⟨hal-01174300⟩
449 View
130 Download


Gmail Facebook X LinkedIn More