On 24/08/12 17:05, Simon Helsen wrote:
"FROM and also including the union is a no-op anyway."
that is your statement
err ... no, it's a fact because a graph is a set of triples. No duplicates.
If the dataset is:
:g1 { :s1 :p1 :o1 }
:g2 { :s2 :p2 :o2 }
and you have
FROM :g1
together with the union of named graphs we have
:s1 :p1 :o1 # union - g1
:s2 :p2 :o2 # union - g2
:s1 :p1 :o1 # explicit FROM
which because a graph is a set of triples is:
:s1 :p1 :o1
:s2 :p2 :o2
which is the union of the named graph alone.
If you union in any triples already there, it's a no-op.
Andy
