W3C home > Mailing lists > Public > public-rdf-dawg-comments@w3.org > March 2006

Re: [OK] Re: [OK?] Re: comments on "SPARQL Query Language for RDF"

From: Peter F. Patel-Schneider <pfps@research.bell-labs.com>
Date: Tue, 07 Mar 2006 11:12:55 -0500 (EST)
Message-Id: <20060307.111255.34583301.pfps@research.bell-labs.com>
To: franconi@inf.unibz.it
Cc: eric@w3.org, connolly@w3.org, public-rdf-dawg-comments@w3.org

From: "Enrico Franconi" <franconi@inf.unibz.it>
Subject: Re: [OK] Re: [OK?] Re: comments on "SPARQL Query Language for RDF" 
Date: Tue, 07 Mar 2006 16:46:33 +0100

> From: Peter F. Patel-Schneider <pfps@research.bell-labs.com>
> > > The scoping graph is always isomorphic to the original dataset - the  
> > > only things that may change are the names of the bnodes. This has no  
> > > effect on the answer set, apart from having possibly different bnode  
> > > names.
> > 
> > Sorry, I meant scoping *set*.
> 
> Ah. Well, for (this version of) SPARQL the scoping set contains exactly the
> URIs, the Literals, and the bnodes from the scoping graph. It is a theorem that

I don't see any such theorem in the documents.

> under these restrictions the definitions given in 2.5 uniquely identify the answer
> set - modulo renaming of bnodes - such that the answer set is exactly the
> outcome of the homomorphisms between the query and the scoping graph.
> 
> cheers
> --e. 

peter
Received on Tuesday, 7 March 2006 16:13:28 GMT

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