To help users get familiar with large RDF graphs, RDF summarization techniques can be used. In this work, we study quotient summaries of RDF graphs, that is: graph summaries derived from a notion of equivalence among RDF graph nodes. We make the following contributions: (i) four novel summaries which are often small and easy-to-comprehend, in the style of E–R diagrams; (ii) efficient (amortized linear-time) algorithms for computing these summaries either from scratch, or incrementally, reflecting additions to the graph; (iii) the first formal study of the interplay between RDF graph saturation in the presence of an RDFS ontology, and summarization; we provide a sufficient condition for a highly efficient shortcut method to build the quotient summary of a graph without saturating it; (iv) formal results establishing the shortcut conditions for some of our summaries and others from the literature; (v) experimental validations of our claim within a tool available online.

中文翻译：

---

RDF图汇总，用于一目了然的结构发现

为了帮助用户熟悉大型RDF图，可以使用RDF摘要技术。在这项工作中，我们研究RDF图的商摘要，即：从RDF图节点之间的等价概念派生的图摘要。我们做出以下贡献：（i）四个新颖的​​摘要，通常小而容易理解，以E–R图的形式出现；（ii）从头开始或以增量方式计算这些汇总的有效（摊销的线性时间）算法，以反映对图形的添加；（iii）首次正式研究存在RDFS本体时RDF图饱和度与摘要之间的相互作用；我们为高效的快捷方法提供了充足的条件，以构建图的商摘要而不会使其饱和；（iv）正式结果为我们的某些摘要和文献中的其他摘要建立了捷径条件；（v）通过在线可用工具对我们的主张进行实验性验证。