- From: Chimezie Ogbuji <ogbujic@ccf.org>
- Date: Tue, 20 Apr 2010 13:29:55 -0400
- To: "Gregory Williams" <greg@evilfunhouse.com>, "SPARQL Working Group WG" <public-rdf-dawg@w3.org>
Per my action (ACTION-116), I have suggested modifications to the text. First, a new entry in the terminology section (under IRI): * Graph Store - An RDF dataset whose named graphs can be added to or deleted from [SPARQL Update]. Modify from: [[[ Network-manipulable RDF (Dataset) - An RDF dataset used by an implementation of this protocol whose named RDF graphs are the targets of the operations and their identifiers are resolvable URIs or URIs that can be embedded in the query component of URI in a manner described later in this document ]]] To [[[ Network-manipulable RDF - A graph store used by an implementation of this protocol whose named RDF graphs can be managed by HTTP operations and their identifiers are resolvable URIs or URIs that can be embedded in the query component of URI in a manner described later in this document ]]] New entries: * Graph IRI - The IRIs involved in this protocol that are specified as a request URI or embedded as a query component *and* correspond to the IRIs in the underlying Network-manipulable RDF. * RDF document - A serialization of an RDF Graph into a concrete syntax [RDF-XML]. [[[ Networked RDF knowledge - ... snip ... An information resource, identified by the IRI of a graph in a network-manipulable RDF dataset ... ]]] ==> [[[ Networked RDF knowledge - ... snip ... An information resource, identified by a graph IRI ... ]]] In every other similar case where there is a reference to dataset, replace with graph store. Add a new sentence to the last paragraph in 2: [[[ Following the terminology in [AWWW], the intuition here is that messages in this HTTP protocol use graph IRIs to access the underlying graph store. The graph IRIs identify networked RDF knowledge. Networked RDF knowledge is distinguished from other kinds of (information) resources by the fact that they are primarily represented by an RDF document and these RDF documents are serializations of RDF graphs in the underlying graph store. ]]] In 4.1: [[[ We recall from [SPARQL] that IRIs for RDF graphs in SPARQL queries identify a resource, and the resource is represented by a graph (or, more precisely: by a document that serializes a graph) ]]] ==> [[[ We recall from [SPARQL] that IRIs for RDF graphs in SPARQL queries identify a resource, and the resource is represented by a graph. ]]] In the third paragraph of this section: [[[ In our example, the corresponding request URI (http://example.com/rdf-graphs/employees) is meant to identify RDF triples on the example.com server that describe employees .. ]]] ==> [[[ In our example, the corresponding request URI (http://example.com/rdf-graphs/employees) is a graph IRI that identifies RDF knowledge about employees .. ]]] In section 5 [[[ .. snip ... performed on Networked RDF knowledge. Where an equivalent SPARQL Update operation is given, <graph_uri> is understood to be either the request URI or the URI indirectly specified via the query component as described above. ]]] ===> [[[ ... snip .. performed on Networked RDF knowledge. Occasionally, an analogous SPARQL Update operation is given to demonstrate how the operations are interpreted. This is meant to be informative and does not dictate a formal binding between the two protocols. Within the given analogous SPARQL Update operations, <graph_uri> is understood to be a graph IRI. As mentioned previously, these do not directly identify the RDF graphs. ]]] And wherever the document says 'is equivalent to' (in reference to the analogous SPARQL Update operations) this should be changed to 'is analogous to' -- Chime [1] http://www.w3.org/2009/sparql/track/actions/116 =================================== P Please consider the environment before printing this e-mail Cleveland Clinic is ranked one of the top hospitals in America by U.S.News & World Report (2009). Visit us online at http://www.clevelandclinic.org for a complete listing of our services, staff and locations. Confidentiality Note: This message is intended for use only by the individual or entity to which it is addressed and may contain information that is privileged, confidential, and exempt from disclosure under applicable law. If the reader of this message is not the intended recipient or the employee or agent responsible for delivering the message to the intended recipient, you are hereby notified that any dissemination, distribution or copying of this communication is strictly prohibited. If you have received this communication in error, please contact the sender immediately and destroy the material in its entirety, whether electronic or hard copy. Thank you.
Received on Tuesday, 20 April 2010 17:30:56 UTC