W3C home > Mailing lists > Public > semantic-web@w3.org > March 2011

Re: canonical RDF graph representations

From: Nathan <nathan@webr3.org>
Date: Tue, 01 Mar 2011 13:01:49 +0000
Message-ID: <4D6CEE3D.7010904@webr3.org>
To: Niklas Lindström <lindstream@gmail.com>
CC: Ivan Shmakov <oneingray@gmail.com>, Ivan Shmakov <ivan@main.uusia.org>, semantic-web@w3.org
can these two handle the case of:

  _:b1 :x _:b2 .
  _:b2 :y _:b1 .

+ yes I agree, would be great to have a canonical representaion and 
comparison method.

Cheers,

Nathan

Niklas Lindström wrote:
> Hi Ivan,
> 
> while this isn't based on this or any newer standard proposal, the
> Python-based RDFLib contains an implementation for canonicalizing and
> comparing graphs. See the the "rdflib.compare" module:
> 
>   http://code.google.com/p/rdflib/source/browse/trunk/rdflib/compare.py
> 
> It would be interesting to standardize something like that; and
> certainly useful for some things.
> 
> Best regards,
> Niklas
> 
> 
> 
> On Tue, Mar 1, 2011 at 10:50 AM, Ivan Shmakov <ivan@main.uusia.org> wrote:
>>        The “The case for generating URIs by hashing RDF content” paper
>>        [1], dating back to 2002, mentions that “there is no current
>>        canonical serialization standard for RDF”.  (Then, they suggest
>>        their own canonical representation.)
>>
>>        I wonder, has such a standard been since proposed?
>>
>> [1] http://www.hpl.hp.com/techreports/2002/HPL-2002-216.pdf
>>
>> --
>> FSF associate member #7257
>>
> 
> 
> 
Received on Tuesday, 1 March 2011 13:03:42 UTC

This archive was generated by hypermail 2.3.1 : Tuesday, 1 March 2016 07:42:26 UTC