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

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

From: Jeremy Carroll <jeremy@topquadrant.com>
Date: Thu, 23 Jun 2011 17:15:00 -0700
Message-ID: <4E03D704.3070700@topquadrant.com>
To: public-rdf-wg@w3.org
On 6/23/2011 4:48 PM, Ian Davis wrote:
> Wouldn't the skolemization proposals make this a lot easier? Skolemize
> the blank nodes according to a deterministic pattern, then sort, then
> sign.
>
> Ian

A difficult to sign/skolemize/canonicalize graph from fig 1 in my paper is

_:b1 eg:p _:b2 .
_:b1 eg:p _:b4 .
_:b1 eg:p _:b3 .
_:b2 eg:p _:b1 .
_:b2 eg:p _:b3 .
_:b2 eg:p _:b5 .
_:b3 eg:p _:b1 .
_:b3 eg:p _:b2 .
_:b3 eg:p _:b6 .
_:b4 eg:p _:b1 .
_:b4 eg:p _:b5 .
_:b4 eg:p _:b6 .
_:b5 eg:p _:b2 .
_:b5 eg:p _:b4 .
_:b5 eg:p _:b6 .
_:b6 eg:p _:b3 .
_:b6 eg:p _:b4 .
_:b6 eg:p _:b5 .
_:c1 eg:p _:c4 .
_:c1 eg:p _:c5 .
_:c1 eg:p _:c6 .
_:c2 eg:p _:c4 .
_:c2 eg:p _:c5 .
_:c2 eg:p _:c6 .
_:c3 eg:p _:c4 .
_:c3 eg:p _:c5 .
_:c3 eg:p _:c6 .
_:c4 eg:p _:c1 .
_:c4 eg:p _:c2 .
_:c4 eg:p _:c3 .
_:c5 eg:p _:c1 .
_:c5 eg:p _:c2 .
_:c5 eg:p _:c3 .
_:c6 eg:p _:c1 .
_:c6 eg:p _:c2 .
_:c6 eg:p _:c3 .

To test your code, randomly reorder these triples and check that you 
always get the same output.

Jeremy
Received on Friday, 24 June 2011 00:15:18 GMT

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