update the normative material on RDF Datasets to reflect recent WG decisions
authorRichard Cyganiak <richard@cyganiak.de>
Fri, 09 Nov 2012 17:06:02 +0000
changeset 537 9eb748f36997
parent 536 6881b3ab4f31
child 538 14e928e29a24
update the normative material on RDF Datasets to reflect recent WG decisions
rdf-concepts/index.html
--- a/rdf-concepts/index.html	Fri Nov 09 15:45:18 2012 +0000
+++ b/rdf-concepts/index.html	Fri Nov 09 17:06:02 2012 +0000
@@ -374,12 +374,24 @@
 <section id="managing-graphs">
     <h3>Merging and Managing RDF Graphs</h3>
 
-    <p class="issue">This section should explain terminology around
-    <a href="#section-dataset">working with multiple graphs</a>,
-    and explain the fact that graphs merge easily.
-    This will be added once the Working Group has finalised a design.</p>
+    <div class="issue">
+    <p>This section is work in progress. It should explain:</p>
 
-    <p class="issue">Should this section define the notion of “graph store”?</p>
+    <ul>
+      <li>The terminology around <a title="RDF dataset">RDF datasets</a></li>
+      <li>The fact that graphs merge easily</li>
+      <li>The concept of a “graph store” (as in SPARQL Update)</li>
+      <li>How RDF datasets can be used to record a snapshot of a graph store</li>
+      <li>The distinction between graph syntaxes and dataset syntaxes</li>
+    </ul>
+    </div>
+
+    <p>The RDF data model expresses information as
+    <a title="RDF graph">RDF graphs</a> consisting of
+    <a title="triple">triples</a> with subject, predicate and object.
+    Often, one wants to hold multiple RDF graphs and record information
+    about each graph, allowing an application to work with datasets
+    that involve information from more than one graph.</p>
 
     <p>An <dfn>RDF document</dfn> is a document that encodes an
     <a>RDF graph</a> in a <dfn>concrete RDF syntax</dfn>, such as
@@ -396,6 +408,8 @@
 <section id="entailment">
     <h3>Formal Meaning and Entailment</h3>
 
+    <p class="issue">This section is work in progress.</p>
+
     <p>The idea of meaning in RDF is underpinned by the formal concept
     of <dfn>entailment</dfn>. In brief, an <a>RDF graph</a> <em>A</em>
     is said to <em>entail</em> another RDF graph <em>B</em> if every
@@ -761,16 +775,6 @@
 <section id="section-dataset">
     <h2>RDF Datasets</h2>
 
-    <p class="issue">This section is a draft and requires more editorial
-    attention.</p>
-
-    <p>The RDF data model expresses information as
-    <a title="RDF graph">RDF graphs</a> consisting of
-    <a title="triple">triples</a> with subject, predicate and object.
-    Often, one wants to hold multiple RDF graphs and record information
-    about each graph, allowing an application to work with datasets
-    that involve information from more than one graph.</p>
-
     <p>An <dfn>RDF Dataset</dfn> is a collection of
     <a title="RDF graph">RDF graphs</a> and comprises:</p>
 
@@ -783,12 +787,25 @@
     Graph names are unique within an RDF dataset.</li>
     </ul>
 
-    <div class="note" id="note-empty-named-graphs">Some RDF dataset
-    implementations do not track empty named graphs.
+    <p><a title="blank node">Blank nodes</a> MAY be shared between graphs
+    in an <a>RDF dataset</a>.</p>
+
+    <p class="note" id="note-graph-name">Despite the use of the word “name”
+    in “<a>named graph</a>”, the <a>graph name</a> does not formally
+    <a>denote</a> the graph. It is merely syntactically paired with
+    the graph. RDF does not place any formal restrictions on what
+    <a>resource</a> the graph name may denote, nor on the relationship between
+    that resource and the graph.</p>
+
+    <div class="note" id="note-empty-named-graphs">Some <a>RDF dataset</a>
+    implementations do not track empty <a title="named graph">named graphs</a>.
     Therefore, to maximize interoperability, applications should avoid
     ascribing importance to the presence of empty named graphs.</div>
 
-    <p class="issue">Should this section define operations between RDF datasets, such as merge and equality/equivalence?</p>
+    <p class="issue">Should RDF Concepts define any operations on RDF datasets,
+    such as merge, union, isomorphism, equality, equivalence? Is anything
+    needed to support the TriG test cases, SPARQL, etc.? This is
+    <a href="https://www.w3.org/2011/rdf-wg/track/issues/111">ISSUE-111</a>.</p>
 </section>
 
 
@@ -1354,6 +1371,7 @@
   <em>RDF 1.1 Concepts and Abstract Syntax</em>.</p>
 
   <ul>
+    <li>2012-11-09: Updated the <a href="#section-dataset">section on RDF datasets</a> to reflect <a href="http://www.w3.org/2011/rdf-wg/meeting/2012-10-29">various WG resolutions</a> around named graphs</li>
     <li>2012-11-09: Re-wrote the <a href="#section-blank-nodes">section on Blank Nodes</a>, including a definition of “fresh blank nodes” and an extended Note on standardizing apart blank node IDs</li>
     <li>2012-11-09: Moved all informative material about changes between RDF 2004 and RDF 1.1 to a <a href="#changes">new appendix</a></li>
     <li>2012-11-07: Add <a href="#change-over-time">new informative section on Change Over Time</a></li>
@@ -1433,10 +1451,6 @@
 
 </section>
 
-
-<section id="references">
-</section>
-
   </body>
 </html>