Parallel Quotient Summarization of RDF Graphs - Archive ouverte HAL Access content directly
Conference Papers Year :

Parallel Quotient Summarization of RDF Graphs

(1, 2) , (1, 2)
1
2

Abstract

Discovering the structure and content of an RDF graph is hard for human users, due to its heterogeneity, complexity, and possibly large size. One class of tools for this task are structural RDF graph summaries, which allow users to grasp the different connections between RDF graph nodes. RDFQuotient graph summaries are a brand of structural summaries we developed. They are usually very compact, making them good for first-sight visual discovery. Existing algorithms for building these summaries are centralized, and require the graph to fit in memory. Going beyond, in this work we present novel algorithms for building RDFQuotient summaries in a parallel, shared-nothing architecture. We instantiate our algorithms to Apache Spark platform; our experiments demonstrate the merit of our approach.
Fichier principal
Vignette du fichier
parasumm_optimized_for_fast_web_viewing.pdf (733.6 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02106521 , version 1 (23-04-2019)

Identifiers

Cite

Pawel Guzewicz, Ioana Manolescu. Parallel Quotient Summarization of RDF Graphs. SBD 2019 - International Workshop on Semantic Big Data, Jun 2019, Amsterdam, Netherlands. ⟨10.1145/3323878.3325809⟩. ⟨hal-02106521⟩
164 View
283 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More