Prof Mazzochi sounds 'way off' ;-) ,
but thats how I've seen references - as the way to encode RDF. I forget how
far we backed off in the final spec, but the idea of including a "following'
clause in the query language was a way to let you query along graphs. I
don't think there's as clean a way to deal with all of RDF (e.g. reification
(statements about statements), anonymous nodes), but I think references
could work reasonably well for general triples.
Jim
From: David Nuescheler <[EMAIL PROTECTED]>
Reply-To: [EMAIL PROTECTED]
To: [email protected]
Subject: Re: associations between nodes
Date: Thu, 28 Jul 2005 16:18:34 +0200
hmmm... it sounds like if we could name relationships we are half way
there?
would the property name for a reference property be a good way of doing
that? if we were to bolt up the Node.getReferences() with a filter for a
particular property name would that be sufficient?
so something like:
profmazzocchi
+- students [joe's-uuid, jack's-uuid]
then this should allow for something like joe.getReferences("students") to
return profmazzocchi...
i may be way off here, but i am sure stefano will tell me ;)
regards,
david
