- From: Dan Connolly <connolly@w3.org>
- Date: Fri, 08 Apr 2005 14:54:27 -0500
- To: RDF Data Access Working Group <public-rdf-dawg@w3.org>
Klyne asks
[[
Source data:
_:a ex:p1 ex:o1 .
_:a ex:p1 ex:o2 .
Query:
CONSTRUCT ( ?s ex:p1 ?o )
WHERE { ( ?s ex:p1 ?o ) }
Result (a):
_:a ex:p1 ex:o1 .
_:a ex:p1 ex:o2 .
or (b):
_:a1 ex:p1 ex:o1 .
_:a2 ex:p1 ex:o2 .
?
]]
http://lists.w3.org/Archives/Public/public-rdf-dawg-comments/2005Apr/0012.html
He thinks (b) and so do I, and I think that follows from the
text, esp from the definition of RDF graph merge. Perhaps
it would be useful to be more explicit about importing the
term "merge" from rdf-mt or rdf-concepts.
In any case, let's add a test case to be sure. Steve, are you game?
Or Dave? Or perhaps I should learn to do these myself?
For reference...
http://www.w3.org/2001/sw/DataAccess/issues#graphSolutionMapping
--
Dan Connolly, W3C http://www.w3.org/People/Connolly/
D3C2 887B 0F92 6005 C541 0875 0F91 96DE 6E52 C29E
Received on Friday, 8 April 2005 19:54:30 UTC