This resource is a pattern catalogue for modelling, publishing, and consuming Linked Data which adopts a tried and tested means of communicating knowledge and experience in software development: the design pattern. The intent is to create a ready reference that will be useful for both the beginner and the experienced practitioner alike. It is also intended to grow and mature in line with the practitioner community. NOTE: This is a book-length resource and covers a wide range of different areas from the design of Web-scale identifiers to application development patterns.
URL: http://patterns.dataincubator.org/book/index.html
Keywords: Reification, Graph annotation, Autodiscovery, Named query, Binding
Author: Dodds, Leigh
Date created: 2012-05-31 04:00:00.000
Language: http://id.loc.gov/vocabulary/iso639-2/eng
Time required: P3H
- Differentiates hierarchical document models (eg, XML) and graph models (RDF).
- Knows Simple Knowledge Organization System, or SKOS (2009), an RDF vocabulary for expressing concepts that are labeled in natural languages, organized into informal hierarchies, and aggregated into co
- Knows the SPARQL 1.1 Graph Store HTTP protocol for updating graphs on a web server (in "restful" style).
- Recognizes that owl:sameAs, while popular as a mapping property, has strong formal semantics that can entail unintended inferences.
- Understands a named graph as one of the collection of graphs comprising an RDF dataset, with a graph name unique in the context of that dataset.
- Understands the use of datatypes and language tags with literals.
- Understands that to be "persistent", a URI must have a stable, well-documented meaning and be plausibly intended to identify a given resource in perpetuity.
- Understands trade-offs between "opaque" URIs and URIs using version numbers, server names, dates, application-specific file extensions, query strings or other obsoletable context.
- Uses a CONSTRUCT query to preview changes before executing an INSERT/DELETE operation.
- Uses CONSTRUCT to extract and transform results into a single RDF graph specified by a graph template.