Updating a pinpoint graph
Various combinations of device and program, from the same or different manufacturers, produce very strange results on not-so-rare occasions. There is the syntactic problem of extracting the data from the strange device or its storage medium and turning into something manageable, such as RDF.There is the semantic problem of understanding what the fields mean: can one have two home phone numbers?
Living Room (3.66m x 3.53m or 12' 0' x 11' 7') Double glazed bay window over looking side aspect, radiator, carpet, built in units.
Because the merging of changes requires more application knowledge than the bare RDF data provides, it is tempting to mix the conversion and sync algorithm.
However, this mixing reduces the modularity and testability of the resulting program.
This work is supported in part by funding from US Defense Advanced Research Projects Agency (DARPA) and Air Force Research Laboratory, Air Force Materiel Command, USAF, under agreement number F30602-00-2-0593, The problem of updating and synchronizing data in the Semantic Web motivates an analog to text diffs for RDF graphs.
This paper discusses the problem of comparing two RDF graphs, generating a set of differences, and updating a graph from a set of differences.The use of RDF to represent test results[EARL],[OWLT] motivates better ways to compare the actual results of software tests with the intended results and isolate the differences.