Skip to Main content Skip to Navigation
Conference papers

Query-oriented Summarization of RDF Graphs

Šejla Čebirić 1, 2 François Goasdoué 3, 1 Ioana Manolescu 1, 2
1 OAK - Database optimizations and architectures for complex large data
LRI - Laboratoire de Recherche en Informatique, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8623
3 SHAMAN - Symbolic and Human-centric view of dAta MANagement
Abstract : 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 SG which summarizes G as accurately as possible, while being possibly orders of magnitude smaller than the original graph. Our approach is query-oriented, i.e., querying a summary of a graph should reflect whether the query has some answers against this graph. The summaries are aimed as a help for query formulation and optimization. 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.
Document type :
Conference papers
Complete list of metadatas
Contributor : Ioana Manolescu <>
Submitted on : Wednesday, July 22, 2015 - 3:45:33 PM
Last modification on : Wednesday, September 16, 2020 - 5:23:32 PM


  • HAL Id : hal-01179484, version 1


Šejla Čebirić, François Goasdoué, Ioana Manolescu. Query-oriented Summarization of RDF Graphs. Data Engineering Meets Semantic Web Workshop (DESWeb), Apr 2015, Seoul, South Korea. ⟨hal-01179484⟩



Record views