Reformulation-based query answering in RDF: alternatives and performance

Damian Bursztyn 1, 2 François Goasdoué 1, 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 : Answering queries over Semantic Web data, i.e., RDF graphs, must account for both explicit data and implicit data, entailed by the explicit data and the semantic constraints holding on them. Two main query answering techniques have been devised, namely Saturation-based (Sat) which precom-putes and adds to the graph all implicit information, and Reformulation-based (Ref) which reformulates the query based on the graph constraints, so that evaluating the refor-mulated query directly against the explicit data (i.e., without considering the constraints) produces the query answer. While Sat is well known, Ref has received less attention so far. In particular, reformulated queries often perform poorly if the query is complex. Our demonstration show-cases a large set of Ref techniques, including but not limited to one we proposed recently. The audience will be able to 1. test them against different datasets, constraints and queries, as well as different well-established systems, 2. analyze and understand the performance challenges they raise, and 3. alter the scenarios to visualize the impact on performance. In particular, we show how a cost-based Ref approach allows avoiding reformulation performance pitfalls.
Type de document :
Communication dans un congrès
Very Large Data Bases, Aug 2015, Hawaii, United States. <>
Liste complète des métadonnées
Contributeur : Damian Bursztyn <>
Soumis le : mercredi 22 juillet 2015 - 15:38:48
Dernière modification le : mercredi 2 août 2017 - 10:06:23
Document(s) archivé(s) le : vendredi 23 octobre 2015 - 10:11:37


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


  • HAL Id : hal-01174298, version 1


Damian Bursztyn, François Goasdoué, Ioana Manolescu. Reformulation-based query answering in RDF: alternatives and performance. Very Large Data Bases, Aug 2015, Hawaii, United States. <>. <hal-01174298>



Consultations de
la notice


Téléchargements du document