Reformulation-based query answering in RDF: alternatives and performance - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

Reformulation-based query answering in RDF: alternatives and performance


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.
Fichier principal
Vignette du fichier
RDFCoversDemo.pdf (595.41 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01174298 , version 1 (22-07-2015)


  • 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⟩
431 View
193 Download


Gmail Facebook Twitter LinkedIn More