From 09ba854d1b8ca4d0668ed5f2d4d7f279d4de0379 Mon Sep 17 00:00:00 2001
From: Ruben Taelman RDF Dataset
predicate and object. Many RDF data stores hold multiple RDF graphs and record information
about each graph, allowing an application to make queries that involve information from more
than one graph.
A SPARQL query is executed against an RDF Dataset which represents a collection of +
A SPARQL query is executed against an RDF Dataset [[RDF12-CONCEPTS]] which represents a collection of graphs. An RDF Dataset comprises one graph, the default graph, which does not have a name, and - zero or more named graphs, where each named graph is identified by an IRI. A SPARQL query can + zero or more named graphs, where each named graph is identified by an IRI or a blank node. A SPARQL query can match different parts of the query pattern against different graphs as described in section 13.3 Querying the Dataset.
An RDF Dataset may contain zero named graphs; an RDF Dataset always contains one default @@ -3138,7 +3138,7 @@
The definition of RDF Dataset does not restrict the relationships of named and default +
The definition of RDF Dataset [[RDF12-CONCEPTS]] does not restrict the relationships of named and default graphs. Information can be repeated in different graphs; relationships between graphs can be exposed. Two useful arrangements are:
Definition: RDF Dataset
-An RDF dataset is a set:
- { G, (<u1>, G1), (<u2>, G2), . .
- . (<un>, Gn) }
- where G and each Gi are graphs, and each <ui> is an IRI. Each
- <ui> is distinct.
G is called the default graph. (<ui>, Gi) are called named - graphs.
-Definition: Active Graph
The active graph is the graph from the dataset used for basic graph pattern matching.
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. Each
+ <ui> is distinct.
G is called the default graph. (<ui>, Gi) are called named + graphs.
+Definition: Active Graph
The active graph is the graph from the dataset used for basic graph pattern matching.
-# Default graph PREFIX dc: <http://purl.org/dc/elements/1.1/> <http://example.org/bob> dc:publisher "Bob" . <http://example.org/alice> dc:publisher "Alice" . --
-# Named graph: http://example.org/bob -PREFIX foaf: <http://xmlns.com/foaf/0.1/> -_:a foaf:name "Bob" . -_:a foaf:mbox <mailto:bob@oldcorp.example.org> . --
-# Named graph: http://example.org/alice -PREFIX foaf: <http://xmlns.com/foaf/0.1/> +GRAPH <http://example.org/bob> { + _:a foaf:name "Bob" . + _:a foaf:mbox <mailto:bob@oldcorp.example.org> . +} -_:a foaf:name "Alice" . -_:a foaf:mbox <mailto:alice@work.example.org> . +GRAPH <http://example.org/alice> { + _:a foaf:name "Alice" . + _:a foaf:mbox <mailto:alice@work.example.org> . +}
In this example, the default graph contains the names of the publishers of two named @@ -3184,7 +3179,6 @@
-# Default graph PREFIX foaf: <http://xmlns.com/foaf/0.1/> _:x foaf:name "Bob" . @@ -3192,20 +3186,16 @@-Examples of RDF Datasets
_:y foaf:name "Alice" . _:y foaf:mbox <mailto:alice@work.example.org> . -
-# Named graph: http://example.org/bob -PREFIX foaf: <http://xmlns.com/foaf/0.1/> -_:a foaf:name "Bob" . -_:a foaf:mbox <mailto:bob@oldcorp.example.org> . --
-# Named graph: http://example.org/alice -PREFIX foaf: <http://xmlns.com/foaf/0.1/> +GRAPH <http://example.org/bob> { + _:a foaf:name "Bob" . + _:a foaf:mbox <mailto:bob@oldcorp.example.org> . +} -_:a foaf:name "Alice" . -_:a foaf:mbox <mailto:alice@work.example> . +GRAPH <http://example.org/alice> { + _:a foaf:name "Alice" . + _:a foaf:mbox <mailto:alice@work.example> . +}
In an RDF merge, blank nodes in the merged graph are not shared with blank nodes from the graphs being merged.
From 77b9f726746e2bd7ba58c29e46716913857e2d81 Mon Sep 17 00:00:00 2001 From: Ruben TaelmanFor 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. Each
+ 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 graphs.
From 44d060e537f336d509ffbec58f8d215a2bc64c3f Mon Sep 17 00:00:00 2001 From: Ruben TaelmanThe 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) }
+ { 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