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

Query-Oriented Summarization of RDF Graphs

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


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 summaries are aimed as a help for query formulation and optimization; in particular, querying a summary of a graph should reflect whether the query has some answers against this graph. 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. The demonstration will allow the audience to compute such summaries out of a large variety of datasets, and explore their usage for data exploration and query optimization.
Fichier principal
Vignette du fichier
SummaryDemoVLDB.pdf (279.88 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01178140 , version 1 (17-07-2015)


  • HAL Id : hal-01178140 , version 1


Šejla Čebirić, François Goasdoué, Ioana Manolescu. Query-Oriented Summarization of RDF Graphs. Proceedings of the VLDB Endowment, Aug 2015, Kohala Coast, Hawaii, United States. ⟨hal-01178140⟩
412 View
277 Download


Gmail Facebook Twitter LinkedIn More