W3C home > Mailing lists > Public > www-rdf-interest@w3.org > July 2001

Matching RDF models + anon nodes

From: Jeremy Carroll <jjc@hplb.hpl.hp.com>
Date: Fri, 13 Jul 2001 10:53:50 +0100
To: <www-rdf-interest@w3.org>
Cc: "Merry, Martin" <Martin_Merry@hplb.hpl.hp.com>
Message-ID: <JAEBJCLMIFLKLOJGMELDIENCCBAA.jjc@hplb.hpl.hp.com>


One of the improvements in Jena-1-1-0
http://www-uk.hpl.hp.com/people/bwm/rdf/jena/
is a matching algorithm that can tell if two models are the same.

The algorithm aligns the anonymous resources; so that two files, identical
except for the order of statements will compare equal.

I've written up the algorithm used, the first draft is available at:

http://www-uk.hpl.hp.com/people/jjc/tmp/matching.pdf

It's based on a standard algorithm from graph theory.

It could also be useful for deeper notions of equivalence (e.g. after we
have decided that certain pairs of URI's actually refer to the same
resource).

Any feedback, including stuff like typos and spelling errors, as well as
more profound comments, would be welcome. I plan to take the doc to a second
final version in three weeks time, when I will post a technical report
number and a non-transitory URL.

enjoy

Jeremy Carroll
HP Labs
Received on Friday, 13 July 2001 05:53:54 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Monday, 7 December 2009 10:51:50 GMT