The concept of an RDF Dataset is defined in [[RDF12-CONCEPTS]].
-For the following definitions, we capture each RDF dataset as a set:
- { G, (<u1>, G1), (<u2>, G2),
- ... (<un>, Gn) }
+
The concept of an RDF Dataset is defined in [[RDF12-CONCEPTS]].
+For the following definitions, we capture each RDF dataset as a set:
++ { G, (<u1>, G1), (<u2>, G2), + ... (<un>, Gn) } + where G and each Gi are graphs, and each <ui> is an IRI or blank node. Each <ui> is distinct.
G is called the default graph. (<ui>, Gi) are called named @@ -7893,33 +7895,6 @@
The active graph is the graph from the dataset used for basic graph pattern matching.
Let DS1 = { G1, (<u11>, G11), (<u12>,
- G12), . . . (<u1n>, G1n) },
- and DS2 = { G2, (<u21>, G21), (<u22>,
- G22), . . . (<u2m>, G2m) }
then we define the RDF Dataset Merge of DS1 and DS2 to be:
- DS={ G, (<u1>, G1), (<u2>, G2), .
- . . (<uk>, Gk) }
- where:
Write N1 for { <u1j> j = 1 to n }
- Write N2 for { <u2j> j = 1 to m }