On 17 January 2013 06:00, Jim McCusker <mcc...@rpi.edu> wrote: > If you would like to validate that an RDF graph hasn't changed, you can > assert it's graph digest. Any new assertions would change the digest hash, > invalidating the asserted graph. The digest can then be signed by the > creator. That would close the (explicit) graph in a very real, computable > way. Here's some howto and implementation:
What method do you use to generate a consistent digest for an arbitrary RDF graph? Cheers, Peter
