A Framework for Efficient Representative Summarization of RDF Graphs - Archive ouverte HAL Access content directly
Conference Papers Year :

A Framework for Efficient Representative Summarization of RDF Graphs

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

Abstract

RDF is the data model of choice for Semantic Web applications. RDF graphs are often large and have heterogeneous, complex structure. Graph summaries are compact structures computed from the input graph; they are typically used to simplify users' experience and to speed up graph processing. We introduce a formal RDF summarization framework, based on graph quotients and RDF node equivalence; our framework can be instantiated with many such equivalence relations. We show that our summaries represent the structure and semantics of the input graph, and establish a sufficient condition on the RDF equivalence relation which ensures that a graph can be summarized more efficiently , without materializing its implicit triples.
Fichier principal
Vignette du fichier
poster-HAL.pdf (185.16 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01577778 , version 1 (28-08-2017)

Identifiers

  • HAL Id : hal-01577778 , version 1

Cite

Šejla Čebirić, François Goasdoué, Ioana Manolescu. A Framework for Efficient Representative Summarization of RDF Graphs. International Semantic Web Conference (ISWC), Oct 2017, Vienna, Austria. ⟨hal-01577778⟩
438 View
171 Download

Share

Gmail Facebook Twitter LinkedIn More