Linked Data¶
Berners-Lee, T. (2006). Linked Data. W3C Design Issues.
Cited by¶
2 citations across 2 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Open Publication for Interoperability
- Linked open data releases vocabularies in dereferenceable form with queryable endpoints.
This sourceStates the four Linked Data principles — use URIs as names, make them dereferenceable over HTTP, provide useful RDF, and link to other URIs — for publishing data in dereferenceable, queryable, reusable form.
Supported in partVerified against the work's full text
Berners-Lee says ontologies are generally served against look-up URIs and that large datasets add SPARQL query services; endpoints are an optional extra for big datasets.
“The third rule, that one should serve information on the web against a URI , is, in 2006, well followed for most ontologies, but, for some reason, not for some major datasets.”
- Linked open data releases vocabularies in dereferenceable form with queryable endpoints.
Domain-specific¶
- Linked Open Data Release
- Berners-Lee articulated the four linked-data design principles in 2006 — use URIs as names, use HTTP URIs, return useful RDF information on lookup, include links to other URIs — and the 5-star openness ladder (open license, machine-readable, non-proprietary format, URI-based, linked) extends those principles to the open-data dimension
This sourceBerners-Lee's Design Issues note, which states the four linked-data rules (posted 27 July 2006) and carries the 5-star openness scheme added to it in 2010, whose rungs run open licence, machine-readable structured data, non-proprietary format, W3C open standards for identifying things, and links to other people's data.
SupportedVerified against the source
- Berners-Lee articulated the four linked-data design principles in 2006 — use URIs as names, use HTTP URIs, return useful RDF information on lookup, include links to other URIs — and the 5-star openness ladder (open license, machine-readable, non-proprietary format, URI-based, linked) extends those principles to the open-data dimension
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Read against the text for 2 of 2 citations: 1 supported, 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:3544e01674d4 · see in the full table