Optimizing Reformulation-based Query Answering in RDF

Damian Bursztyn 1, 2 François Goasdoué 3 Ioana Manolescu 1, 2
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
3 PILGRIM - Gradedness, Imprecision, and Mediation in Database Management Systems
Abstract : Reformulation-based query answering is a query processing technique aiming at answering queries under constraints. It consists of reformulating the query based on the constraints, so that evaluating the reformulated query directly against the data (i.e., without considering any more the constraints) produces the correct answer set. In this paper, we consider optimizing reformulation-based query answering in the setting of ontology-based data access, where SPARQL conjunctive queries are posed against RDF facts on which constraints expressed by an RDF Schema hold. The literature provides query reformulation algorithms for many fragments of RDF. However, reformulated queries may be complex, thus may not be efficiently processed by a query engine; well established query engines even fail processing them in some cases. Our contribution is (i) to generalize prior query reformu-lation languages, leading to investigating a space of refor-mulated queries we call JUCQs (joins of unions of conjunctive queries), instead of a single reformulation; and (ii) an effective and efficient cost-based algorithm for selecting from this space, the reformulated query with the lowest estimated cost. Our experiments show that our technique enables reformulation-based query answering where the state-of-the-art approaches are simply unfeasible, while it may decrease its cost by orders of magnitude in other cases.
Type de document :
Communication dans un congrès
EDBT: 18th International Conference on Extending Database Technology, Mar 2015, Brussels, Belgium. <http://edbticdt2015.be/>
Liste complète des métadonnées

Contributeur : Damian Bursztyn <>
Soumis le : jeudi 16 avril 2015 - 15:59:51
Dernière modification le : samedi 18 février 2017 - 01:09:42


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


  • HAL Id : hal-01143068, version 1


Damian Bursztyn, François Goasdoué, Ioana Manolescu. Optimizing Reformulation-based Query Answering in RDF. EDBT: 18th International Conference on Extending Database Technology, Mar 2015, Brussels, Belgium. <http://edbticdt2015.be/>. <hal-01143068>



Consultations de
la notice


Téléchargements du document