W3C home > Mailing lists > Public > semantic-web@w3.org > November 2012

Re: Current agreement upon named graphs

From: Paola Di Maio <paola.dimaio@gmail.com>
Date: Fri, 9 Nov 2012 14:04:32 +0000
Message-ID: <CAMXe=Sqru912u3RV7quf2qx=f1BLNLVQGWndc6OMWPQLHb2fWA@mail.gmail.com>
To: Olivier Rossel <olivier.rossel@gmail.com>
Cc: semantic-web@w3.org
Oliver

 have been trying to learn about the sw for some time, and take the
opportunity to
test my understanding  answering your own question  (non normative)
 ( the others I not sure)


> Here are my questions:
>  - can a triple belong to several named graphs?
>

would say yes


>  - can the argument of the SPARQL "GRAPH" keyword  be *a list* of named
> graph?
> if yes, is this list considered to be the union of all those named graphs?
>  - is there a plan to investigate algebra of named graphs, such as :
> (namedGraph1 && !namedGraph2) || namedGraph3?
>
> Any comment is welcome.
>
> Cheers,
>
> Olivier.
>
>
Received on Friday, 9 November 2012 14:05:06 GMT

This archive was generated by hypermail 2.3.1 : Tuesday, 26 March 2013 21:45:52 GMT