Delta: an Ontology for the Distribution of Di erences between RDF Graphs
Abstract. The problem of updating and synchronizing data in the Semantic Web motivates an analog to text dis,for RDF graphs. This paper discusses the problem of comparing two RDF graphs, generating a set of dierences, and updating a graph from a set of dierences. It discusses two forms of dierence information, the context-sensitive “weak” patch, and the context-free “strong” patch. It gives a proposed update ontology for patch files for RDF, and discusses experience with proof of concept code.
- 5Codd E F, A relational model of data for large shared data banks. 1970.M.D. computing : computers in medical practice, pp. 162-166, 1998.
- 6Johannes Köbler, Uwe Schöning, Jacobo Torán. The graph isomorphism problem: its structural complexity.The graph isomorphism problem: its structural complexity, 1994.
World Wide Web Conference Series, 2004.