W3C home > Mailing lists > Public > www-rdf-interest@w3.org > May 2000

RE: Model Digest Algorithm

From: McBride, Brian <bwm@hplb.hpl.hp.com>
Date: Tue, 2 May 2000 14:25:49 +0100
Message-ID: <7686E88F1253D311A867006008CD059F11377F@0-mail-1.hpl.hp.com>
To: "'Graham Klyne'" <GK@Dial.pipex.com>, "RDF Interest (E-mail)" <www-rdf-interest@w3.org>
>As Brian has already demonstrated, the XOR aggregator is not 
>even for case (a).  The immediately evident problem here is 
>that (X XOR Y 
>XOR Y) == X, for all Y.  So how about using simple addition, 
>modulo 2^n, as 
>an aggregator?

There is a small subtlety here.  An RDF model is a set of statements.
Sets have no duplicates, so no statement can appear twice.  
Cancellation is therefore less of a risk.

Received on Tuesday, 2 May 2000 09:26:00 UTC

This archive was generated by hypermail 2.3.1 : Wednesday, 7 January 2015 15:07:29 UTC