Replace "linked data graph" with "JSON-LD graph" and make "JSON-LD data model" a proper defined term
authorMarkus Lanthaler <mark_lanthaler@gmx.net>
Mon, 01 Oct 2012 14:38:00 +0200
changeset 895 6ab1df39c6e8
parent 894 fc9384b5d7d5
child 896 402ed9100a96
Replace "linked data graph" with "JSON-LD graph" and make "JSON-LD data model" a proper defined term

@cygri, please don't hesitate to re-open the issue again if you still believe your comments haven't been addressed properly.

This closes #158.
spec/latest/json-ld-api/index.html
spec/latest/json-ld-syntax/index.html
--- a/spec/latest/json-ld-api/index.html	Mon Oct 01 14:30:49 2012 +0200
+++ b/spec/latest/json-ld-api/index.html	Mon Oct 01 14:38:00 2012 +0200
@@ -643,22 +643,22 @@
     <dt><tdef><abbr title="Internationalized Resource Identifier">IRI</abbr></tdef></dt>
     <dd>An Internationalized Resource Identifier as described in [[!RFC3987]].</dd>
     <dt><tdef>Linked Data</tdef></dt>
-    <dd>A set of documents, each containing a representation of a <tref>linked data graph</tref>.</dd>
-    <dt><tdef>linked data graph</tdef></dt>
+    <dd>A technique for creating a network of inter-connected data across different documents and Web sites.</dd>
+    <dt><tdef>JSON-LD graph</tdef></dt>
     <dd>An unordered labeled directed graph, where <tref title="node">nodes</tref> are
       <tref title="IRI">IRIs</tref> or <tref title="Blank Node">Blank Nodes</tref>, or other values.
-      A <tref>linked data graph</tref> is a generalized representation of a
+      A <tref>JSON-LD graph</tref> is a generalized representation of a
       <cite><a href="http://www.w3.org/TR/rdf11-concepts/#dfn-rdf-graph">RDF graph</a></cite>
       as defined in [[!RDF-CONCEPTS]].</dd>
     <dt><tdef>named graph</tdef></dt>
-    <dd>A <tref>linked data graph</tref> that is identified by an <tref>IRI</tref>.</dd>
+    <dd>A <tref>JSON-LD graph</tref> that is identified by an <tref>IRI</tref>.</dd>
     <dt><tdef>graph name</tdef></dt>
     <dd>The <tref>IRI</tref> identifying a <tref>named graph</tref>.</dd>
     <dt><tdef>default graph</tdef></dt>
     <dd>When executing an algorithm, the graph where data should be placed
       if a <tref>named graph</tref> is not specified.</dd>
     <dt><tdef>node</tdef></dt>
-    <dd>A piece of information that is represented in a <tref>linked data graph</tref>.</dd>
+    <dd>A piece of information that is represented in a <tref>JSON-LD graph</tref>.</dd>
     <dt><tdef>node definition</tdef></dt>
     <dd>A <tref>JSON object</tref> used to represent a <tref>node</tref> and
       one or more properties of that node. A <tref>JSON object</tref> is a
@@ -669,16 +669,16 @@
     <dd>A <tref>JSON object</tref> used to reference a node having only the
       <code>@id</code> key.</dd>
     <dt><tdef>blank node</tdef></dt>
-    <dd>A <tref>node</tref> in the <tref>linked data graph</tref> that does not contain a de-referenceable
+    <dd>A <tref>node</tref> in a <tref>JSON-LD graph</tref> that does not contain a de-referenceable
       identifier because it is either ephemeral in nature or does not contain information that needs to be
-      linked to from outside of the linked data graph. A blank node is assigned an identifier starting with
+      linked to from outside of the JSON-LD graph. A blank node is assigned an identifier starting with
       the prefix <code>_:</code>.</dd>
     <dt><tdef>property</tdef></dt>
-    <dd>The <tref>IRI</tref> label of an edge in a <tref>linked data graph</tref>.</dd>
+    <dd>The <tref>IRI</tref> label of an edge in a <tref>JSON-LD graph</tref>.</dd>
     <dt><tdef>subject</tdef></dt>
-    <dd>A <tref>node</tref> in a <tref>linked data graph</tref> with at least one outgoing edge, related to an <tref>object</tref> node through a <tref>property</tref>.</dd>
+    <dd>A <tref>node</tref> in a <tref>JSON-LD graph</tref> with at least one outgoing edge, related to an <tref>object</tref> node through a <tref>property</tref>.</dd>
     <dt><tdef>object</tdef></dt>
-    <dd>A <tref>node</tref> in a <tref>linked data graph</tref> with at least one incoming edge.</dd>
+    <dd>A <tref>node</tref> in a <tref>JSON-LD graph</tref> with at least one incoming edge.</dd>
     <dt><tdef>quad</tdef></dt>
     <dd>A piece of information that contains four items; a <tref>subject</tref>, a <tref>property</tref>,
       an <tref>object</tref>, and a <tref>graph name</tref>.</dd>
@@ -705,7 +705,7 @@
         <a href="#expansion">Expands</a> the given <code>input</code> according to
         the steps in the <a href="#expansion-algorithm">Expansion Algorithm</a>. The
         <code>input</code> MUST be copied, expanded and returned if there are
-        no errors. If the expansion fails, an appropriate error MUST be 
+        no errors. If the expansion fails, an appropriate error MUST be
         returned via the callback.
 
         <dl class="parameters">
@@ -747,7 +747,7 @@
         <code>context</code> according to the steps in the
         <a href="#compaction-algorithm">Compaction Algorithm</a>. The
         <code>input</code> MUST be copied, compacted and returned if there are
-        no errors. If the compaction fails, an appropriate error MUST be 
+        no errors. If the compaction fails, an appropriate error MUST be
         returned via the callback.
 
         <dl class="parameters">
@@ -770,7 +770,7 @@
           <dt>INVALID_SYNTAX</dt>
           <dd>A general syntax error was detected in the <code>@context</code>.
             For example, if a <code>@type</code> key maps to anything other than
-            <code>@id</code> or an <tref>absolute IRI</tref>, this error 
+            <code>@id</code> or an <tref>absolute IRI</tref>, this error
             would be returned via the <code>callback</code>.</dd>
           <dt>LOAD_ERROR</dt>
           <dd>There was a problem encountered loading a remote context.</dd>
@@ -794,7 +794,7 @@
       <dd>Creates a JSON-LD document given an set of <ldtref title="Quad">Quads</ldtref>.
         <dl class="parameters">
           <dt>Quad[] input</dt>
-          <dd>A set of <tref>linked data graph</tref>s represented as an array of <ldtref title="Quad">Quads</ldtref>.</dd>
+          <dd>A set of <tref title="JSON-LD graph">JSON-LD graphs</tref> represented as an array of <ldtref title="Quad">Quads</ldtref>.</dd>
           <dt>JsonLdCallback callback</dt>
           <dd>A callback that is called when processing is complete on
             the given <code>input</code>.</dd>
@@ -849,34 +849,34 @@
     <h3>Callbacks</h3>
 
     <p class="issue" data-number="153">
-    Developers should note that the details of error handling and 
+    Developers should note that the details of error handling and
     conformance handling are being actively debated.
     </p>
-    
+
     <p>JSON-LD processors utilize a variety of callbacks in order to return
     information in an asynchronous manner to calling applications. This section
-    details the parameters sent to those callbacks as well as the desired 
-    operation of the callbacks.  
+    details the parameters sent to those callbacks as well as the desired
+    operation of the callbacks.
     </p>
-    
+
     <section>
       <h3>JsonLdProcessingError</h3>
       <p>The <a>JsonLdError</a> type is used to encapsulate a variety of
       parameters that outline the cause of a particular
       <a>JsonLdProcessor</a> error.</p>
-      
+
       <dl title="dictionary JsonLdProcessingError" class="idl">
         <dt>string type</dt>
-        <dd>a string representing the particular error type, 
-          such as <code>LIST_OF_LISTS_DETECTED</code>, as described in 
+        <dd>a string representing the particular error type,
+          such as <code>LIST_OF_LISTS_DETECTED</code>, as described in
           the various algorithms in this document.</dd>
         <dt>string operation</dt>
         <dd>a string representing the operation that was being performed
           when the conformance issue was raised. Valid values for the
-          string include <code>compact</code>, <code>expand</code>, 
+          string include <code>compact</code>, <code>expand</code>,
         <code>toRDF</code>, and <code>fromRDF</code>.</dd>
         <dt>object or object[] source</dt>
-          <dd>An object reference to the original JSON-LD document being 
+          <dd>An object reference to the original JSON-LD document being
           processed.</dd>
         <dt>string sourceKey</dt>
           <dd>The key value associated with the value that triggered the
@@ -885,15 +885,15 @@
           <dd>The value that triggered the conformance issue.</dd>
       </dl>
     </section>
-  
+
     <section>
       <h3>JsonLdCallback</h3>
-      <p>The <a>JsonLdCallback</a> is used to return a processed JSON-LD 
+      <p>The <a>JsonLdCallback</a> is used to return a processed JSON-LD
         representation as the result of processing an API method.</p>
-  
+
       <dl title="[NoInterfaceObject Callback] interface JsonLdCallback"
           class="idl">
-  
+
         <dt>void processingComplete()</dt>
         <dd>This callback is invoked when processing is complete.
         <dl class="parameters">
@@ -909,15 +909,15 @@
         </dd>
       </dl>
     </section>
-  
+
     <section>
       <h3>QuadCallback</h3>
       <p>The <a>QuadCallback</a> is called whenever the processor generates a
       quad during processing.</p>
-  
+
       <dl title="[NoInterfaceObject Callback] interface QuadCallback"
           class="idl">
-  
+
         <dt>void quad()</dt>
         <dd>This callback is invoked whenever a quad is generated by the processor.
         <dl class="parameters">
@@ -936,29 +936,29 @@
 
     <section>
       <h3>ConformanceCallback</h3>
-      
+
       <p>The <a>ConformanceCallback</a> MAY be specified in the
       <a>JsonLdOptions</a> via the <code>conformanceCallback</code> parameter.
-      If specified, the callback is called whenever a recoverable conformance 
-      issue is detected. The developer may then determine whether or not 
+      If specified, the callback is called whenever a recoverable conformance
+      issue is detected. The developer may then determine whether or not
       processing should continue based on the type of conformance issue.</p>
-  
+
       <dl title="[NoInterfaceObject Callback] interface ConformanceCallback"
           class="idl">
-  
+
         <dt>void issue()</dt>
         <dd>This callback is invoked when a conformance issue is detected by
           the JSON-LD processor.
         <dl class="parameters">
            <dt>JsonLdProcessingError issue</dt>
-           <dd>Details about the conformance issue. 
+           <dd>Details about the conformance issue.
            </dd>
            <dt>function callback</dt>
            <dd>A function that MUST be called when the program has determined
              how to respond to the conformance issue. A single parameter must be
-             passed to the callback. The value of the parameter should be  
+             passed to the callback. The value of the parameter should be
              <code>null</code> if processing should continue by acting as if the
-             key-value that triggered the issue never existed. The 
+             key-value that triggered the issue never existed. The
              <code>issue</code> SHOULD be passed to the callback without
              modification if processing should stop.</dd>
         </dl>
@@ -997,17 +997,17 @@
         all arrays will remain arrays even if they have just one element.
       </dd>
       <dt>boolean flatten = false</dt>
-      <dd>If set to a value that is not <code>false</code>, 
-        the JSON-LD processor must modify the output of the 
-        <a href="#compaction-algorithm">Compaction Algorithm</a> 
-        or the <a href="#expansion-algorithm">Expansion Algorithm</a> by 
+      <dd>If set to a value that is not <code>false</code>,
+        the JSON-LD processor must modify the output of the
+        <a href="#compaction-algorithm">Compaction Algorithm</a>
+        or the <a href="#expansion-algorithm">Expansion Algorithm</a> by
         coalescing all properties associated with each
         <tref>subject</tref> via the
         <a href="#flattening-algorithm">Flattening Algorithm</a>. The value
         of <code>flatten</code> MUST be either an <tref>IRI</tref> value
         representing the name of the graph to flatten, or <code>true</code>.
         If the value is <code>true</code>, then the first graph encountered in
-        the input document is selected and flattened.   
+        the input document is selected and flattened.
       </dd>
       <dt>boolean optimize = false</dt>
       <dd>If set to <code>true</code>, the JSON-LD processor is allowed to
@@ -1032,12 +1032,12 @@
         <tref title="number">JSON numbers</tref>.
       </dd>
       <dt>function conformanceCallback = null</dt>
-      <dd>The purpose of this option is to instruct the processor about whether 
+      <dd>The purpose of this option is to instruct the processor about whether
         or not it should continue processing. If the value is <code>null</code>,
-        the processor should ignore any key-value pair associated with any 
+        the processor should ignore any key-value pair associated with any
         recoverable conformance issue and continue processing. More details
-        about this feature can be found in the <a>ConformanceCallback</a> 
-        section.  
+        about this feature can be found in the <a>ConformanceCallback</a>
+        section.
       </dd>
     </dl>
     </section>
@@ -1075,7 +1075,7 @@
     <h3>Node</h3>
     <p><ldtref>Node</ldtref> is the base class of <ldtref>IRI</ldtref>,
     <ldtref>BlankNode</ldtref>, and <ldtref>Literal</ldtref>. It is the IDL
-    representation of a <tref>linked data graph</tref> <tref>node</tref>.</p>
+    representation of a <tref>JSON-LD graph</tref> <tref>node</tref>.</p>
     <dl title="[NoInterfaceObject] interface Node" class="idl">
     </dl>
     </section>
@@ -1093,10 +1093,10 @@
     <section>
     <h3>Blank Node</h3>
 
-    <p>A <tref>node</tref> in the <tref>linked data graph</tref> that
+    <p>A <tref>node</tref> in a <tref>JSON-LD graph</tref> that
     does not contain a de-reference-able identifier because it is either
     ephemeral in nature or does not contain information that needs to be linked
-    to from outside of the <tref>linked data graph</tref>.
+    to from outside of a <tref>JSON-LD graph</tref>.
     A blank node is assigned an identifier starting
     with the prefix <code>_:</code> and an implementation dependent,
     auto-generated suffix that is unique to all information associated with the
@@ -2045,10 +2045,10 @@
   </p>
   <p>
     As with other grammars used for describing <tref>Linked Data</tref>, a key
-    concept is that of a <tref>node</tref> in a <tref>linked data graph</tref>.
+    concept is that of a <tref>node</tref> in a <tref>JSON-LD graph</tref>.
     Nodes may be of three basic types.
     The first is the <ldtref>IRI</ldtref>, which is used to refer to
-    <tref>node</tref>s in other <tref>linked data graph</tref>s.
+    <tref title="node">nodes</tref> in other <tref title="JSON-LD graph">JSON-LD graphs</tref>.
     The second is the
     <tref>blank node</tref>, which are nodes for which an external name does not
     exist, or is not known. The third is a <tref>Literal</tref>, which express
--- a/spec/latest/json-ld-syntax/index.html	Mon Oct 01 14:30:49 2012 +0200
+++ b/spec/latest/json-ld-syntax/index.html	Mon Oct 01 14:38:00 2012 +0200
@@ -519,29 +519,21 @@
   JSON-LD data model encapsulates the following concepts:</p>
 
 <ol>
-  <li>The JSON-LD data model is used to represent <tref>linked data graph</tref>s.</li>
-  <li>A <tdef>linked data graph</tdef> is an unordered labeled directed graph, where each <tdef>node</tdef> is a <tref>subject</tref> or <tref>object</tref>, and edges are labeled using <tref title="property">properties</tref>.</li>
-  <li>A <tdef>subject</tdef> is any node in a <tref>linked data graph</tref> with at least one outgoing edge.</li>
+  <li>The <tdef>JSON-LD data model</tdef> is used to represent <tref title="JSON-LD graph">JSON-LD graphs</tref>.</li>
+  <li>A <tdef>JSON-LD graph</tdef> is an unordered labeled directed graph, where each <tdef>node</tdef> is a <tref>subject</tref> or <tref>object</tref>, and edges are labeled using <tref title="property">properties</tref>.</li>
+  <li>A <tdef>subject</tdef> is any node in a <tref>JSON-LD graph</tref> with at least one outgoing edge.</li>
   <li>A <tref>subject</tref> SHOULD be labeled with an <tref><abbr title="Internationalized Resource Identifier">IRI</abbr></tref> (an Internationalized Resource Identifier as described in [[!RFC3987]]).</li>
-  <li>An <tdef>object</tdef> is a node in a <tref>linked data graph</tref> with at least one incoming edge.</li>
+  <li>An <tdef>object</tdef> is a node in a <tref>JSON-LD graph</tref> with at least one incoming edge.</li>
   <li>An <tref>object</tref> MAY be labeled with an <tref>IRI</tref> or a label that is not an <tref>IRI</tref> such as plain text, internationalized text, or a strictly-typed data value.</li>
   <li>A <tref>node</tref> MAY be a <tref>subject</tref> and an <tref>object</tref> at the same time.</li>
-  <li>A <tdef>property</tdef> is the label on an edge in a <tref>linked data graph</tref>.</li>
+  <li>A <tdef>property</tdef> is the label on an edge in a <tref>JSON-LD graph</tref>.</li>
   <li>A <tref>property</tref> SHOULD be an <tref>IRI</tref>.</li>
-  <li>An <tref>IRI</tref> that is a label in a <tref>linked data graph</tref> SHOULD be dereferencable to a <tref>Linked Data</tref> document describing the labeled <tref>subject</tref>, <tref>property</tref> or <tref>object</tref>.</li>
+  <li>An <tref>IRI</tref> that is a label in a <tref>JSON-LD graph</tref> SHOULD be dereferencable to a <tref>Linked Data</tref> document describing the labeled <tref>subject</tref>, <tref>property</tref> or <tref>object</tref>.</li>
 </ol>
 
-<div class="note">
-  <p>
-A <tref>Linked Data</tref> document does not necessarily need to be expressed
-in JSON-LD. The notion of <tref>Linked Data</tref> is a concept independent of
-any given serialization format.
-  </p>
-</div>
-
-<img style="padding: 5px; border-style: solid; border-width: 1px; display: block; margin-left: auto; margin-right: auto;" src="linked-data-graph.png" title="An example of a linked data graph" longdesc="An example of a linked data graph showing two main nodes labeled with URLs for Alice and Bob. The Alice node contains two other connected nodes showing Alice's age (32) and name (Alice)."/>
+<img style="padding: 5px; border-style: solid; border-width: 1px; display: block; margin-left: auto; margin-right: auto;" src="linked-data-graph.png" title="An example of a JSON-LD graph" longdesc="An example of a JSON-LD graph showing two main nodes labeled with URLs for Alice and Bob. The Alice node contains two other connected nodes showing Alice's age (32) and name (Alice)."/>
 <p style="text-align: center;">
-Figure 1: An example of a linked data graph.
+Figure 1: An example of a JSON-LD graph.
 </p>
 <p>There are a number of best practices that can ensure that developers
 will generate good Linked Data for the Web. JSON-LD
@@ -624,7 +616,7 @@
   developers to express specific identifiers in a compact manner. The
   <code>@context</code> keyword is described in detail in the section titled
   <a href="#the-context"></a>.</dd>
-<dt><code>@graph</code></dt><dd>Used to explicitly label a <tref>linked data graph</tref>.
+<dt><code>@graph</code></dt><dd>Used to explicitly label a <tref>JSON-LD graph</tref>.
   This keyword is described in <a href="#named-graphs"></a>.</dd>
 <dt><code>@id</code></dt>
 <dd>Used to uniquely identify <em>things</em> that are being described in the document.
@@ -2406,7 +2398,7 @@
     manner. A developer may name data expressed using the <code>@graph</code>
     <tref>keyword</tref> by pairing it with an <code>@id</code>
     <tref>keyword</tref>. This enables the developer to make statements
-    about a <tref>linked data graph</tref> itself,
+    about a <tref>JSON-LD graph</tref> itself,
     rather than just a single <tref>node</tref>.</p>
 
   <pre class="example" data-transform="updateExample">
@@ -2441,7 +2433,7 @@
   </pre>
 
   <p>The example above expresses a <em>named</em>
-    <tref>linked data graph</tref> that is identified by the <tref>IRI</tref>
+    <tref>JSON-LD graph</tref> that is identified by the <tref>IRI</tref>
     <code>http://example.org/graphs/73</code>. That graph is composed of the
     statements about Manu and Gregg. Metadata about the graph itself is also
     expressed via the <code>asOf</code> property, which specifies when the
@@ -3154,7 +3146,7 @@
   not. Expressing properties as BNodes in JSON-LD only becomes an issue
   (and could raise an exception) when it is transformed to RDF.</p>
 
-  <p>Note that the JSON-LD data model is silent on the topic of
+  <p>Note that the <tref>JSON-LD data model</tref> is silent on the topic of
   <tref title="unlabeled node">unlabeled nodes</tref>. Nevertheless,
   this specification allows for the expression of
   <tref title="unlabeled node">unlabeled nodes</tref>, as most graph-based data
@@ -3508,7 +3500,7 @@
 </dl>
 
 <p>Fragment identifiers used with <a href="#application-ld-json">application/ld+json</a>
-  resources MAY identify a node in the <tref>linked data graph</tref> expressed in
+  resources MAY identify a node in a <tref>JSON-LD graph</tref> expressed in
   the resource. This idiom, which is also used in RDF [[RDF-CONCEPTS]], gives a
   simple way to "mint" new, document-local IRIs to label nodes and therefore contributes
   considerably to the expressive power of JSON-LD.</p>