Optimizing FOL reducible query answering

Damian Bursztyn 1, 2 François Goasdoué 1, 3 Ioana Manolescu 1, 2
1 OAK - Database optimizations and architectures for complex large data
CNRS - Centre National de la Recherche Scientifique : UMR8623, Inria Saclay - Ile de France, UP11 - Université Paris-Sud - Paris 11, LRI - Laboratoire de Recherche en Informatique
3 PILGRIM - Gradedness, Imprecision, and Mediation in Database Management Systems
IRISA-D7 - GESTION DES DONNÉES ET DE LA CONNAISSANCE
Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [31 references]  Display  Hide  Download

https://hal.inria.fr/hal-01174300
Contributor : Damian Bursztyn <>
Submitted on : Wednesday, July 8, 2015 - 7:11:35 PM
Last modification on : Thursday, November 15, 2018 - 11:57:40 AM
Long-term archiving on : Friday, October 9, 2015 - 11:25:47 AM

File

dlr-bda15.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01174300, version 1

Citation

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

Share

Metrics

Record views

935

Files downloads

176