Not logged in.
This page provides a structured representation (serialized as HTML+RDFa) of the description of the entity denoted ("referred to") by the hyperlink that anchors the About: <Entity Label> text at the top.
The data is presented here in the form of a collection of Entity->Attribute->Value (EAV) or Subject->Predicate->Object (SPO) relations.
In conformance with core Web Architecture, the same description data may also be retrieved in a variety of other negotiable serialization formats, which currently include CSV, HTML+Microdata, (X)HTML+RDFa, N-Triples, Turtle, N3, RDF/JSON, JSON-LD, RDF/XML, Atom, and CXML.
This page and its neighbors provide 5-Star Linked Data URIs (Web Super Keys) for HTTP-accessible data. These URIs are powerful starting points for serendipitous data discovery using the Web's "follow your nose" pattern, as well as a key ingredient for SPARQL queries over HTTP, ODBC, JDBC, ADO.NET, OLE-DB, or XMLA connections.
A single link from this page can be the seed of a powerful Web traversal, en route to discovery and exploitation of unimagined insights, using existing tools such as browsers, spreadsheets, business intelligence and analytics packages, basic report writers, presentation generators, project management packages, and many others.
A variety of discovery pointers are available to users and user agents (software programs) that include:
<link />
relations embedded within the <head />
section of each description page Link:
" response headers included as part of HTTP response metadata.Yes! Simply include entries, based on the example below, in the <head/>
section of your (X)HTML page, whether static or dynamically generated --
<link rel="related" title="My Data in Linked Data form" href="http://linkeddata.uriburner.com/about/id/<scheme-part-of-url>/<host-part-of-url>/<path-part-of-url>" />
The scheme part is the first bit of a URI, up to but not including the first colon (":
").
The host part includes the port, if any, and is found between the double solidus ("//
") following the first colon, and the first solidus ("/
") thereafter.
The path part is everything thereafter (possibly including a query part or fragment identifier part).
For example, if your original page were at --
http://en.wikipedia.org/wiki/Linked_Data
-- the scheme part is "http
", the host part is "en.wikipedia.org
", and the path part is "wiki/Linked_Data
".
You could therefore provide access to a Linked Data graph rendition by including a <head/>
entry like this --
<link rel="related" title="Linked data - Wikipedia, the free encyclopedia - in Linked Data form" href="http://linkeddata.uriburner.com/about/id/http/en.wikipedia.org/wiki/Linked_Data" />
md5sum is a computer program that calculates and verifies 128-bit MD5 hashes, as described in RFC 1321. The MD5 hash functions as a compact digital fingerprint of a file. As with all such hashing algorithms, there is theoretically an unlimited number of files that will have any given MD5 hash. However, it is very unlikely that any two non-identical files in the real world will have the same MD5 hash, unless they have been specifically created to have the same hash. The original C code was written by Ulrich Drepper and extracted from a 2001 release of glibc.
Property | Value |
---|---|
type |
|
sameAs |
|
wasDerivedFrom |
|
dbpedia-owl:abstract |
|
dbpedia-owl:wikiPageID |
|
dbpedia-owl:wikiPageRevisionID |
|
dbpprop:caption |
|
comment |
|
label |
|
dbpprop:wikiPageUsesTemplate |
|
name |
|
topic |
|
name |
|
hypernym |
|
license |
|
dbpprop:license |
|
dbpedia-owl:computingPlatform |
|
operating system |
|
Subject |
|
is primary topic of |
|
dbpedia-owl:wikiPageLength |
|
dbpedia-owl:wikiPageWikiLink |
|
dbpprop:operatingSystem |
|
dbpprop:platform |
|
dbpedia-owl:genre |
|
dbpprop:genre |
|
Property | Value |
---|---|
sameAs |
|
dbpedia-owl:wikiPageRedirects |
|
primary topic |
|
dbpedia-owl:wikiPageWikiLink |
|
inDataset |
|