Revisiting RDF storage layouts for efficient query answering - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2020

Revisiting RDF storage layouts for efficient query answering

Abstract

The performance of query answering in an RDF database strongly depends on the data layout, that is, the way data is split in persistent data structures. We consider answering Basic Graph Pattern Queries (BGPQs), and in particular those with variables (also) in class and property positions, in the presence of RDFS ontologies, both through data saturation and query reformulation. We show that such demanding queries often lead to inefficient query answering on two popular storage layouts, so-called T and CP. We present novel query answering algorithms on the TCP layout, which combines T and CP. In exchange to occupying more storage space, e.g. on an inexpensive disk, TCP avoids the bad or even catastrophic performance that T and/or CP sometimes exhibit. We also introduce summary-based pruning, a novel technique based on existing RDF quotient summaries, which improves query answering performance on the T, CP and the more robust TCP layouts.
Fichier principal
Vignette du fichier
main.pdf (492.22 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02921457 , version 1 (25-08-2020)

Licence

Attribution

Identifiers

  • HAL Id : hal-02921457 , version 1

Cite

Maxime Buron, François Goasdoué, Ioana Manolescu, Tayeb Merabti, Marie-Laure Mugnier. Revisiting RDF storage layouts for efficient query answering. SSWS 2020 - 13th International Workshop on Scalable Semantic Web Knowledge Base Systems, Nov 2020, Athène, Greece. pp.17-32. ⟨hal-02921457⟩
147 View
231 Download

Share

Gmail Facebook X LinkedIn More