Authors: Li Ding, Tim Finin, Yun Peng, Paulo Pinheiro da Silva, and Deborah L. McGuinness

Book Title: TR-CS-05-06

Date: April 30, 2005

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.

Type: TechReport

Institution: UMBC

Tags: semantic web, rdf, owl, provenance

Google Scholar: search

Number of downloads: 1263

Available for download as

size: 196932 bytes

Related Projects:

Past Project

 Swoogle.

Bookmark at: Digg | Del.icio.us | Connotea | CiteULike