Query-Oriented Summarization of RDF Graphs - Archive ouverte HAL Access content directly
Conference Papers Year :

Query-Oriented Summarization of RDF Graphs

(1, 2) , (3, 4) , (1, 2)
1
2
3
4

Abstract

The Resource Description Framework (RDF) is the W3C’s graph data model for Semantic Web applications. We study the problem of RDF graph summarization: given an input RDF graph G, find an RDF graph G' which summarizes G as accurately as possible, while being possibly orders of magnitude smaller than the original graph. Our approach is query-oriented, i.e., querying a summary of a graph should reflect whether the query has some answers against this graph. The summaries are aimed as a help for query formulation and optimization. We introduce two summaries: a baseline which is compact and simple and satisfies certain accuracy and representativeness properties, but may oversimplify the RDF graph, and a refined one which trades some of these properties for more accuracy in representing the structure.
Fichier principal
Vignette du fichier
paper_42.pdf (237.32 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01176277 , version 1 (15-07-2015)

Identifiers

  • HAL Id : hal-01176277 , version 1

Cite

Šejla Čebirić, François Goasdoué, Ioana Manolescu. Query-Oriented Summarization of RDF Graphs. Data Science - 30th British International Conference on Databases, BICOD 2015, Edinburgh, UK, July 6-8, 2015, Proceedings, Jul 2015, Edinburgh, United Kingdom. pp.87--91. ⟨hal-01176277⟩
488 View
176 Download

Share

Gmail Facebook Twitter LinkedIn More