A generalisation of the Linked Data publishing guideline

Initially (in summer 2006), Tim Berners Lee composed the Linked Data publishing guideline to address shortcomings of predominant data providing practices in the Web and to promote the benefits of utilizing Semantic Web knowledge representation models for that issue. Later, people started realizing the independency of these principles to concrete applied technologies, i.e., the Linked Data publishing guideline is generally independent from Semantic Web technologies. This movement is especially propagated by Kingsley Idehen (see [1]).
The Linked Data publishing guideline addresses the following five main principles. Whereby, the fifth one is a recently made, optional addition that was suggested by Matthew Rowe (see [2]).

  1. Use a name reference mechanism for resource identification, e.g., URIs (cf. the first interface constraint of the REST architectural style).
  2. Use an information resource delivering mechanism on top of that name reference mechanism, e.g., a URI scheme, for example, HTTP URIs, to enable the transfer of a document that contains at least the information resource to a requested resource identifier (cf. the second interface constraint of the REST architectural style*).
  3. Use a resource description mechanism to facilitate the expression of knowledge (assertions) regarding the denoted resource, e.g., RDF (cf. the forth interface constraint of the REST architectural style).
  4. Provide a resource connection mechanism to permit the embedding of links. They refer to other resources to establish meaningful (unambiguously as possible) interpretations of a received information resource. This enforces knowledge exploration, e.g., via the HTTP Link header field, if, for instance, the specification of the media type does not make link embedding in the representation possible (cf. “follow your nose” and the fifth interface constraint of the REST architectural style).
  5. Provide an information resource modification mechanism by allowing (optionally) the transfer of (a) modification(s) of received content by using the resource identifier of the request, e.g., changes are entered in a (HTML) form and sent to the server by applying the HTTP PATCH method (cf. the third interface constraint of the REST architectural style).

Thereby, especially the last principle directs into a read and write enabled Linked Data information space scenario (see [3]). A good overview of relevant specifications for Linked Data in the context of the Semantic Web can be found at linkeddata-specs.info.

*) Note, this constraint was later explicitly phrased, see the referenced presentation.

[1] Idehen, Kingsley; “What is Linked Data, really?”; openlinksw.com; 2011
[2] Rowe, Matthew; “A Proposed 5th Rule/Principle for Linked Data: Push”; matthew-rowe.com; 2010
[3] Berners-Lee, Tim; “Read-Write Linked Data”; w3.org; 2010

Further related resources:

Posted in description | Tagged , , , , , , , , , , , | 12 Comments

The common, layered Semantic Web technology stack

A visualization of the common, layered Semantic Web technology stack
Here is a visualization of the common, layered Semantic Web technology stack. This graphic is a modified version of the Semantic Web technology stack visualization created by Benjamin Nowack. This figure is freely usable and sharable under the Creative Common Attribution 3.0 Unported license.
Here are some references to get into some parts of the different layers:

Posted in description | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , | 1 Comment