W3C home > Mailing lists > Public > w3c-rdfcore-wg@w3.org > March 2002

Re: motivation for bNodes/existentials in RDF; note for parsers

From: Patrick Stickler <patrick.stickler@nokia.com>
Date: Mon, 25 Mar 2002 10:09:43 +0200
To: Dan Connolly <connolly@w3.org>, Pat Hayes <phayes@ai.uwf.edu>
CC: RDF Core <w3c-rdfcore-wg@w3.org>, Massimo Marchiori <massimo@w3.org>, Lynn Andrea Stein <las@olin.edu>
Message-ID: <B8C4A7E7.117BE%patrick.stickler@nokia.com>
On 2002-03-23 4:58, "ext Dan Connolly" <connolly@w3.org> wrote:

> Dave, I wonder if the syntax spec should
> say something about "in the past, RDF
> parsers have parsed anonymous nodes
> by generating arbitrary URIs; don't do that;
> make sure the parser client can tell the
> URI references from the anonymous nodes".

Would it be useful to have a standardized means of generating
URIs for anonymous nodes such that

a) applications can tell a node is anonymous
b) graph merges do not result in collisions

E.g., define a URI scheme that is analogous to uuid: but
call it e.g. anon:


Only anonymous nodes would be labled with anon: URIs (if
someone uses an anon: URI to denote something other than
an anonymous node, they get what they deserve).

Graphs with such anonymous node URIs can be merged with
wanton abandon as they will not collide, since they are
based on UUIDs.



Patrick Stickler              Phone: +358 50 483 9453
Senior Research Scientist     Fax:   +358 7180 35409
Nokia Research Center         Email: patrick.stickler@nokia.com
Received on Monday, 25 March 2002 03:07:33 UTC

This archive was generated by hypermail 2.3.1 : Wednesday, 7 January 2015 14:53:56 UTC