Query-Oriented Summarization of RDF Graphs

被引：6

作者：

Cebiric, Sejla ^{[1
,2
]}

Goasdoue, Francois ^{[1
,2
,3
]}

Manolescu, Ioana ^{[1
,2
]}

机构：

[1] INRIA, Saclay, France

[2] Univ Paris 11, Saclay, France

[3] Univ Rennes 1, Lannion, France

来源：

DATA SCIENCE | 2015年 / 9147卷

关键词：

D O I：

10.1007/978-3-319-20424-6_9

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：87 / 91

页数：5