W3C home > Mailing lists > Public > public-rdf-wg@w3.org > March 2011

[GRAPHS] One graph to bind them all ?

From: Fabien Gandon <fabien.gandon@inria.fr>
Date: Wed, 2 Mar 2011 00:33:50 +0100 (CET)
To: RDF WG <public-rdf-wg@w3.org>
Message-ID: <98434611.192249.1299022430390.JavaMail.root@zmbs1.inria.fr>

Going through the numerous messages about RDF graphs, g-*, named graphs, graph literals, etc. I felt that there is one question which has not been explicitly addressed and which for me is important for instance when it comes to handling blank nodes.

One of the things I liked in the notion of "surface" as proposed by Pat (unless I am mistaken) is that they natively support overlapping i.e. a given triple can belong to several surfaces. This ability to support multiple partitioning of a triple set, overlapping g-boxes, would lead me to say that a blank node participating to the overlap of two g-boxes should be considered the same shared blank node in the two g-boxes.

In other words I believe we need to decide if there can be overlaps between g-boxes, between g-snaps and between g-texts.

I am convinced we need to allow overlapping g-boxes.
I am not too sure about overlapping g-snaps and overlapping g-texts.

my two cents,
fabien, inria, @fabien_gandon, http://fabien.info
Received on Tuesday, 1 March 2011 23:34:24 UTC

This archive was generated by hypermail 2.4.0 : Friday, 17 January 2020 17:04:03 UTC