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

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.
http://dvcs.w3.org/hg/rdf/raw-file/default/rdf-concepts/index.html#section-skolemization

Best,
Richard


> 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