A Framework for Efficient Representative Summarization of RDF Graphs

Šejla Čebirić 1, 2, 3 François Goasdoué 1, 4 Ioana Manolescu 1, 2, 3
1 CEDAR - Rich Data Analytics at Cloud Scale
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France
4 SHAMAN - Symbolic and Human-centric view of dAta MANagement
IRISA-D7 - GESTION DES DONNÉES ET DE LA CONNAISSANCE
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 materi- alizing its implicit triples.
Document type :
Reports
Complete list of metadatas

Cited literature [5 references]  Display  Hide  Download

https://hal.inria.fr/hal-01577431
Contributor : Ioana Manolescu <>
Submitted on : Monday, August 28, 2017 - 9:25:39 AM
Last modification on : Thursday, June 13, 2019 - 11:34:02 AM

File

RR-9090.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01577431, version 1

Citation

Šejla Čebirić, François Goasdoué, Ioana Manolescu. A Framework for Efficient Representative Summarization of RDF Graphs. [Research Report] RR-9090, Inria Saclay Ile de France; Ecole Polytechnique,; Université de Rennes 1 [UR1]. 2017, pp.11. ⟨hal-01577431⟩

Share

Metrics

Record views

814

Files downloads

164