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

Re: Returning datasets (was: Re: side remarks on the shortcut discussion for INSERT/DELETE...)

From: Steve Harris <steve.harris@garlik.com>
Date: Sun, 14 Feb 2010 00:27:38 +0000
Cc: SPARQL Working Group <public-rdf-dawg@w3.org>
Message-Id: <15CFD3A1-E94D-4750-B1E0-7A3F067B3ABF@garlik.com>
To: Andy Seaborne <andy.seaborne@talis.com>
On 12 Feb 2010, at 21:04, Andy Seaborne wrote:
>
>>> Two points: (1) use of GRAPH and (2) patterns that are more than
>>> templates. The pattern needs restricting (which is why it didn't
>>> happen at 1.0)
>>>
>>> It is worth noting that this is an extension to the SPARQL Query
>>> language that has repercussions on existing implementation design  
>>> and
>>> on protocol because CONSTRUCT returns a graph currently, not an RDF
>>> dataset.
>>
>> Well, some implementations return N3 currently, and as I understand  
>> it
>> N3 can encode named graphs, so I'm not sure that this is a big issue
>> conceptually.
>
> Digressing ...
>
> N3 graphs (formulae) are literals [1].  N3 extends RDF terms to  
> include graphs.  And they can occur in the subject position :-) And  
> you can have graph literals inside graph literals.

Ah, I see.

- Steve

-- 
Steve Harris, Garlik Limited
2 Sheen Road, Richmond, TW9 1AE, UK
+44 20 8973 2465  http://www.garlik.com/
Registered in England and Wales 535 7233 VAT # 849 0517 11
Registered office: Thames House, Portsmouth Road, Esher, Surrey, KT10  
9AD
Received on Sunday, 14 February 2010 00:28:06 GMT

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