W3C home > Mailing lists > Public > public-rdf-dawg-comments@w3.org > October 2005

Re: Traversing trees with sparql?

From: Danny Ayers <danny.ayers@gmail.com>
Date: Wed, 26 Oct 2005 23:28:43 +0200
Message-ID: <1f2ed5cd0510261428k115a27c1p532ed47ce539fbd1@mail.gmail.com>
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?



Received on Wednesday, 26 October 2005 21:30:09 UTC

This archive was generated by hypermail 2.3.1 : Tuesday, 6 January 2015 20:52:06 UTC