http://www.hpl.hp.com/techreports/2003/HPL-2003-235R1.html
But there's a faster way to compute bnode identities that was presented at ISWC this year, I still need to incorporate it: http://iswc2012.semanticweb.org/sites/default/files/paper_16.pdf Jim On Wed, Jan 16, 2013 at 5:22 PM, Peter Ansell <ansell.pe...@gmail.com>wrote: > 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 > -- Jim McCusker Programmer Analyst Krauthammer Lab, Pathology Informatics Yale School of Medicine james.mccus...@yale.edu | (203) 785-4436 http://krauthammerlab.med.yale.edu PhD Student Tetherless World Constellation Rensselaer Polytechnic Institute mcc...@cs.rpi.edu http://tw.rpi.edu