W3C home > Mailing lists > Public > public-rdf-dawg@w3.org > January to March 2011

Re: Update comment

From: Andy Seaborne <andy.seaborne@epimorphics.com>
Date: Thu, 24 Mar 2011 12:09:13 +0000
Message-ID: <4D8B3469.8090406@epimorphics.com>
To: Lee Feigenbaum <lee@thefigtrees.net>
CC: SPARQL Working Group <public-rdf-dawg@w3.org>


On 24/03/11 12:02, Lee Feigenbaum wrote:
> On 3/24/2011 5:11 AM, Andy Seaborne wrote:
>>
>>
>>
>> """
>> The USING [NAMED] <uri> clauses define a dataset to be used in matching
>> the WHERE clause. uris identify graphs in the graph store. All uris in a
>> USING <uri> form are used to form a graph which is the union of the
>> graphs named, and is teh default graph of the dataset, and all uris in a
>> USING NAMED <uri> form the named graph of the datasets.
>>
>> If a USING or USING NAMED clause appears, then this will override any
>> effect that WITH may have on the WHERE clause, and only the WHERE clause.
>> """
>
> So would I not be (conformantly) allowed to implement update in such a
> way that I can match data retrieved from outside the graph store and use
> that to update graphs in the graph store?
> I don't do that today, but I surely will in the future :) Perhaps I
> could still do that via a creative interpretation of exactly what my
> graph store consists of.
>

You can do that with LOAD+USING, which has the advantage that it keeps a 
copy around for use in several operations.

That way gets the bNodes stable across operations in a request (my 
wording uses "union" -- that was intentional).

> Anyway, I'm fine with this change, just still trying to understand it.
>
> Lee
>
>> Notes: "named graphs" is a term defined in SPARQL 1.0.
>>
>> Lots of s/uri/iri/ for the update document.
>>
>> Andy
>>
Received on Thursday, 24 March 2011 12:09:54 GMT

This archive was generated by hypermail 2.3.1 : Tuesday, 26 March 2013 16:15:45 GMT