W3C home > Mailing lists > Public > www-rdf-interest@w3.org > April 2004

Re: named graphs

From: Jeremy Carroll <jjc@hplb.hpl.hp.com>
Date: Fri, 30 Apr 2004 14:21:13 +0100
Message-ID: <409252C9.7050405@hplb.hpl.hp.com>
To: Phil Dawes <pdawes@users.sourceforge.net>
Cc: www-rdf-interest@w3.org


Realistically I think you're looking at quite a while before there is 
any real useable software. Even longer before there are specs, rather 
than some ideas that a few of us have put together



Phil Dawes wrote:

> Hi All,
> 
> I'm getting to the point where I need to start including provenance
> information in response to queries. I was wondering where the whole
> standardisation process is wrt named graphs.
> 
> - Does the trix proposal represent current thinking in this field?
> 
>    - e.g. is the standardised model likely to be radically different
>    to its multiple closed-graphs approach?
> 

who knows? Standardization is about getting buy-in from most or all the 
players. The current state of the TriX work is that it has explicit 
buy-in from four individuals - that's a long way short of a standard!




> - Are there any triple stores that support the notion of named
> graphs internally? (i.e through the api)
> 

If you're needing to be shipping code, your best bet would be to go with 
any quad or reification solution (that has tackled the inefficiency 
problems, such as Jena's), but use that in a way that conforms with the 
papers that Chris pointed to - there is also a modified version of the 
RDF Triples in XML paper that I should make publically available.

> 
> - Has there been any work on query languages supporting querying
> across graphs?
> 
> e.g.
> select ?foo, ?bah
> from <grapha>, <graphb>, <graphc>
> where (...)
> 
> Cheers,
> 
> Phil
> 

Jeremy
Received on Friday, 30 April 2004 09:24:05 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Monday, 7 December 2009 10:52:06 GMT