Tracking RDF Graph Provenance using RDF Molecules

Li Ding, Yun Peng, Paulo Pinheiro da Silva, Deborah L. McGuinness

Maryland Shared Open Access Repository (USMAI Consortium) · 2005 · 91 citations · 16 references

DOIFull text

Open access

Concepts

TL;DR

The Semantic Web integrates partial knowledge and supports hypothesis testing, yet the granularity of RDF graph provenance is debated because RDF documents are too coarse and triples can share blank nodes, making lossless restoration difficult; a lossless sub‑graph can reconstruct the original graph without new triples, and a finest sub‑graph cannot be further decomposed. This study investigates lossless decomposition of RDF graphs and tracks provenance using RDF molecules, the finest lossless components. The authors develop lossless decomposition algorithms and RDF molecules to represent the finest components of an RDF graph for provenance tracking. The algorithms and RDF molecules were formalized and implemented in a prototype provenance service within the Swoogle project.

Abstract

The Semantic Web facilitates integrating partial knowledge and finding evidence for hypothesis from web knowledge sources. However, the appropriate level of granularity for tracking provenance of RDF graph remains in debate. RDF document is too coarse since it could contain irrelevant information. RDF triple will fail when two triples share the same blank node. Therefore, this paper investigates lossless decomposition of RDF graph and tracking the provenance of RDF graph using RDF molecule, which is the finest and lossless component of an RDF graph. A sub-graph is {\em lossless} if it can be used to restore the original graph without introducing new triples. A sub-graph is {\em finest} if it cannot be further decomposed into lossless sub-graphs. The lossless decomposition algorithms and RDF molecule have been formalized and implemented by a prototype RDF graph provenance service in Swoogle project.

References

16