Tracking rdf graph provenance using rdf molecules

From Semantic Portal Wiki

Edit

Reference:

1. Li Ding, Tim Finin, Yun Peng, Paulo Pinheiro da Silva, Deborah L. McGuinness. Tracking RDF Graph Provenance using RDF Molecules , Proceedings of the Fourth International Semantic Web Conference, 2005

bibtex

@inproceedings { KSL-05-06 ,
  author = "Li Ding, Tim Finin, Yun Peng, Paulo Pinheiro da Silva, Deborah L. McGuinness", 
booktitle = "Proceedings of the Fourth International Semantic Web Conference", 
title = "Tracking RDF Graph Provenance using RDF Molecules", 
year = "2005", 
} 

abstract: The Semantic Web can be viewed as one large ``universal RDF graphdistributed across many Web pages. This is an impractical for manyreasons, so we usually work with a decomposition into RDF documents,each of which corresponds to an individual Web page. While this isnatural and appropriate for most tasks, it is still too coarse forsome. For example, many RDF documents may redundantly contain thesame data and some documents comprise large amounts of weakly-relatedor unrelated data. Decomposing a document into its RDF triples isusually too fine a decomposition, information may be lost if the graphcontains blank nodes. We define an intermediate decomposition of anRDF graph G into a set of RDF ``molecules, each of which is aconnected sub-graph of the original. The decomposition is ``lossless in thatthe molecules can be recombined to yield G even if their blank nodesIDs are ``standardized apart.RDF molecules provide a useful granularity for tracking the provenanceof or evidence for information found in an RDF graph. Doing so at thedocument level (e.g., find other documents with identical graphs) mayfind too few matches. Working at the triple level will just fail forany triples containing blank nodes. RDF molecules are the finestgranularity at which we can do this without loss of information. Wedefine the RDF molecule concept in more detail, describe an algorithmto decompose an RDF graph into its molecules, and show how these canbe used to find evidence to support the original graph. Thedecomposition algorithm and the provenance application have both beenprototyped in a simple Web-based demonstration.

download:

• paper: KSL-05-06.pdf
• slides: