Optimizing FOL reducible query answeringReportar como inadecuado




Optimizing FOL reducible query answering - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

1 OAK - Database optimizations and architectures for complex large data LRI - Laboratoire de Recherche en Informatique, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8623 2 UP11 - Université Paris-Sud - Paris 11 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.





Autor: Damian Bursztyn - François Goasdoué - Ioana Manolescu -

Fuente: https://hal.archives-ouvertes.fr/



DESCARGAR PDF




Documentos relacionados