The notion of RDF Named Graphs has been proposed in order to assign provenance information to data described using RDF triples. This paper argues that named graphs alone cannot capture provenance information in the presence of RDF Schema reasoning and updates. In order to address this problem, the authors introduce the notion of RDF/S Graphsets, in which a graphset is associated with a set of RDF named graphs and contain the triples that are jointly owned by the named graphs that constitute the graphset. They formalize the notions of RDF named graphs and RDF/S graphsets and propose query and update languages that can be used to handle provenance information for RDF/S graphs taking into account RDF Schema semantics.
URL: https://www.usenix.org/legacy/event/tapp09/tech/full_papers/pediaditis/pediaditis_html/
Keywords: Named graph, RDF Schema, Provenance
Author: Christophides, V.
Language: http://id.loc.gov/vocabulary/iso639-2/eng
Time required: P30M
- Grasps essential differences between schemas for syntactic validation (e.g., XML) and for inferencing (RDF Schema).
- 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 that resources are declared to be members (instances) of classes using the property rdf:type.