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

Comments on SPARQL: Semantics of queries involving named graphs

From: Jagannathan Srinivasan <jagannathan.srinivasan@oracle.com>
Date: Wed, 31 Aug 2005 21:47:14 -0400
Message-ID: <43165DA2.3020801@oracle.com>
To: public-rdf-dawg-comments@w3.org
CC: jags Srinivasan <Jagannathan.Srinivasan@oracle.com>

Hi,

Can you clarify the query semantics for the following cases:

A SPARQL query can specify RDF dataset as follows:
FROM d1
FROM d2
...
FROM dn

FROM NAMED g1
FROM NAMED g2
...
FROM NAMED gm

Then the query may use graph clause in several ways:
1) GRAPH gx (explicit naming) => BUT, gx may not exist in {g1, g2, ..., 
gm}, then what is the expected behavior?
2) GRAPH ?g (variable-based naming)
    ?g may get instantiated from global (that is not enclosed inside a 
GRAPH clause) graph-pattern to a value gx (say)
    BUT gx may not be a member of {g1, g2, ..., gm}, then what is the 
expected behavior?

Thanks,

Jags
Received on Thursday, 1 September 2005 01:47:23 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Tuesday, 8 January 2008 14:14:49 GMT