Skip to main navigation Skip to search Skip to main content

Query-Oriented summarization of RDF graphs

  • INRIA and U. Paris-Sud

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

9 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationData Science - 30th British International Conference on Databases, BICOD 2015, Proceedings
EditorsSebastian Maneth
PublisherSpringer Verlag
Pages87-91
Number of pages5
ISBN (Electronic)9783319204239
DOIs
Publication statusPublished - 1 Jan 2015
Externally publishedYes
Event30th British International Conference on Databases, BICOD 2015 - Edinburgh, United Kingdom
Duration: 6 Jul 20158 Jul 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9147
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference30th British International Conference on Databases, BICOD 2015
Country/TerritoryUnited Kingdom
CityEdinburgh
Period6/07/158/07/15

Fingerprint

Dive into the research topics of 'Query-Oriented summarization of RDF graphs'. Together they form a unique fingerprint.

Cite this