A Framework for Efficient Representative Summarization of RDF Graphs

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.
Type de document :
Communication dans un congrès
International Semantic Web Conference (ISWC), Oct 2017, Vienna, Austria. International Semantic Web Conference (ISWC) <https://iswc2017.semanticweb.org/>
Liste complète des métadonnées


https://hal.inria.fr/hal-01577778
Contributeur : Ioana Manolescu <>
Soumis le : lundi 28 août 2017 - 10:11:41
Dernière modification le : mercredi 30 août 2017 - 01:08:57

Fichier

poster-HAL.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01577778, version 1

Citation

Š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. International Semantic Web Conference (ISWC) <https://iswc2017.semanticweb.org/>. <hal-01577778>

Partager

Métriques

Consultations de
la notice

142

Téléchargements du document

23