The Semantic Web facilitates the integration of partial knowledge and finding evidence for hypothesis from Web knowledge sources. However, the appropriate level of granularity for tracking provenance of RDF graphs remains in debate. The RDF document level is too coarse because it could contain irrelevant information. On the other hand, the RDF triple level will fail when two triples share the same blank node. Therefore, this paper investigates lossless decomposition of RDF graphs and tracking the provenance of RDF graphs using the "RDF molecule", which is the finest and most lossless component of an RDF graph.
Keywords: Provenance, Graph decomposition, Blank nodes, Named graph
Author: Peng, Yun
Publisher: Pinheiro da Silva, Paulo
Date created: 2005-01-01 05:00:00.000
Time required: P20M
Educational use: professionalDevelopment
Interactivity type: expositive
- Understands a named graph as one of the collection of graphs comprising an RDF dataset, with a graph name unique in the context of that dataset.
- Understands blank nodes and their uses.
- Understands that Linked Data (2006) extended the notion of a web of documents (the Web) to a notion of a web of finer-grained data (the Linked Data cloud).