Tracking RDF Graph Provenance using RDF Molecules

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.
Date: April 30, 2005
Book Title: TR-CS-05-06
Type: TechReport
Publisher: UMBC
Downloads: 2063

Has 1 soft copy


size 196932 bytes

Bibtex


@TechReport{Tracking_RDF_Graph_Provenance_using_RDF_,
  author = "Li Ding and Tim Finin and Yun Peng and Paulo Pinheiro da Silva and Deborah L. McGuinness",
  title = "{Tracking RDF Graph Provenance using RDF Molecules}",
  month = "April",
  year = "2005",
  booktitle = "TR-CS-05-06",
  institution = "UMBC",
}