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

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

From: Richard Cyganiak <richard@cyganiak.de>
Date: Tue, 28 Jun 2011 09:21:07 +0100
Cc: Ian Davis <ian.davis@talis.com>, RDF-WG WG <public-rdf-wg@w3.org>
Message-Id: <FC24A70A-D28F-4C32-96B0-2435755EB145@cyganiak.de>
To: Gavin Carothers <gavin@topquadrant.com>
On 24 Jun 2011, at 00:52, Gavin Carothers wrote:
>> Wouldn't the skolemization proposals make this a lot easier? Skolemize
>> the blank nodes according to a deterministic pattern, then sort, then
>> sign.
> That was one of my hopes early on following the skolemization work.
> However as the current skolemization processes demands that two
> systems must skolemize blank nodes to different URIs

It doesn't demand that.


> this doesn't work
> that well in practice. It may be that the skolemization process can be
> defined in terms of c14n algorithm.
> Cheers,
> Gavin
Received on Tuesday, 28 June 2011 08:21:37 UTC

This archive was generated by hypermail 2.3.1 : Tuesday, 6 January 2015 22:01:59 UTC