W3C home > Mailing lists > Public > public-rdf-dawg@w3.org > July to September 2004

RE: Queries over multiple graphs

From: Seaborne, Andy <andy.seaborne@hp.com>
Date: Tue, 28 Sep 2004 11:52:54 +0100
Message-ID: <8D5B24B83C6A2E4B9E7EE5FA82627DC9396759@sdcexcea01.emea.cpqcorp.net>
To: "Steve Harris" <S.W.Harris@ecs.soton.ac.uk>, "DAWG public list" <public-rdf-dawg@w3.org>




-------- Original Message --------
> From: Steve Harris <>
> Date: 28 September 2004 11:47
> 
> In recent discussions over email and on IRC this morning we hit a
> difference of implementation in some RDF storage systems.
> 
> In my system if you load multiple graphs with distinct source
> information 
> and the same statement appears in 2 graphs there are two distinct
> statements. The same goes for statements that may be inferred by
> multiple 
> routes.
> 
> However in Andy's implementation this is not the case, meaning that

Minor point.  My test cases were not the output of an implementation.
They were manually derived from my reading of "4.2 Aggregation Graphs"
which says "merge".  I'll implement what the WG decides.

	Andy

> queries such as
> 
> SELECT ?s ?p ?o WHERE (?s ?p ?o)
> 
> will return different results.
> 
> Which of these is alloed depends on wether DAWG RDF systems are
required
> to RDF merge all the graphs they load.
> 
> - Steve
Received on Tuesday, 28 September 2004 10:53:27 GMT

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