- From: Danny Ayers <danny.ayers@gmail.com>
- Date: Wed, 26 Oct 2005 23:28:43 +0200
- To: Richard Newman <r.newman@reading.ac.uk>
- Cc: "Jones, David H" <david.h.jones@boeing.com>, public-rdf-dawg-comments@w3.org
On 10/26/05, Richard Newman <r.newman@reading.ac.uk> wrote:
> If SPARQL supported transitive properties, it would be fairly
> straightforward to dump the tree structure with one query*, then cut
> it down on the client and issue one big DESCRIBE query with all of
> the desired nodes.
> * e.g. SELECT ?x ?y WHERE { ?x dmoz:narrow ?y . } WITH TRANSITIVE
> ( dmoz:narrow )
I assume you're describing a Lisp style of recursion (I'm loath to
say that in ignorance, but that Lisp book I ordered hasn't yet arrived
;-). If that's near enough, what I don't really get is how 1. the
transitivity is an especially useful special case of the rules; 2. how
you deal with the closure thing, i.e. how do you do the bounds on such
an operator?
Cheers,
Danny.
--
http://dannyayers.com
Received on Wednesday, 26 October 2005 21:30:09 UTC