W3C home > Mailing lists > Public > public-rdf-dawg@w3.org > July to September 2009

Re: [TF-PP] Possible starting points

From: Paul Gearon <gearon@ieee.org>
Date: Tue, 29 Sep 2009 10:46:08 -0400
Message-ID: <a25ac1f0909290746x68326990l8c298ebde6ef3430@mail.gmail.com>
To: Luke Wilson-Mawer <luke.wilson-mawer@garlik.com>
Cc: SPARQL Working Group <public-rdf-dawg@w3.org>
On Tue, Sep 29, 2009 at 10:35 AM, Luke Wilson-Mawer
<luke.wilson-mawer@garlik.com> wrote:
> Hi Paul,
> One question...
> Paul Gearon wrote:
>>> 2/ Property paths with variables and IRIs or prefixed names.
>>> (issues include restriction of what can be asked a la ?p* discussion)
>> +1. Takes memory, but is not hard (I've implemented this in the past).
> H did your implementation behave when binding multiple ?ps ?

It depended. If the query plan bound the predicate first, then it was fine.

If not, then any non-trivial graph needed to remember every node in
the graph in RAM as it went (I remember these to detect loops). But in
general it was OK. It's a pretty simple technique. (I'll explain it if
that helps)

Received on Tuesday, 29 September 2009 14:46:55 UTC

This archive was generated by hypermail 2.3.1 : Wednesday, 7 January 2015 15:00:57 UTC