W3C home > Mailing lists > Public > public-rdf-wg@w3.org > June 2011

Re: Need for a canonical byte stream for an RDF graph

From: Ian Davis <ian.davis@talis.com>
Date: Fri, 24 Jun 2011 00:48:08 +0100
Message-ID: <BANLkTimCotmehVTyhYORE2UAvBdzKKiqWg@mail.gmail.com>
To: Gavin Carothers <gavin@topquadrant.com>
Cc: RDF-WG WG <public-rdf-wg@w3.org>
On Fri, Jun 24, 2011 at 12:39 AM, Gavin Carothers <gavin@topquadrant.com> wrote:
> It seems that creating a standard canonical byte stream based on an
> abstract syntax graph would be very useful. It also seems reasonably
> easy. The simplest naive approach of sorting N-Triples works
> reasonably well. Until that is you encounter our good old friend Blank
> Nodes. Happily the majority of the work needed to address blank nodes
> can be found in Jeremy Carroll's paper "Signing RDF Graphs"
> http://www.hpl.hp.com/techreports/2003/HPL-2003-142.html from back in
> 2003.

Wouldn't the skolemization proposals make this a lot easier? Skolemize
the blank nodes according to a deterministic pattern, then sort, then
sign.

Ian
-- 
Ian Davis, Chief Technology Officer, Talis Group Ltd.
http://www.talis.com/ | Registered in UK and Wales as 5382297
Received on Thursday, 23 June 2011 23:48:37 GMT

This archive was generated by hypermail 2.3.1 : Tuesday, 26 March 2013 16:25:44 GMT