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" />
The principle of least effort is a broad theory that covers diverse fields from evolutionary biology to webpage design. It postulates that animals, people, and even well-designed machines will naturally choose the path of least resistance or "effort". It is closely related to many other similar principles: see Principle of least action or other articles listed . This is perhaps best known or at least documented among researchers in the field of library and information science. Their principle states that an information-seeking client will tend to use the most convenient search method in the least exacting mode available. Information-seeking behavior stops as soon as minimally acceptable results are found. This theory holds true regardless of the user's proficiency as a searcher, or their l
Property | Value |
---|---|
type |
|
sameAs |
|
wasDerivedFrom |
|
dbpedia-owl:abstract |
|
dbpedia-owl:wikiPageID |
|
dbpedia-owl:wikiPageRevisionID |
|
comment |
|
label |
|
dbpprop:wikiPageUsesTemplate |
|
topic |
|
hypernym |
|
Subject |
|
is primary topic of |
|
dbpedia-owl:wikiPageLength |
|
dbpedia-owl:wikiPageWikiLink |
|
Property | Value |
---|---|
sameAs |
|
primary topic |
|
dbpedia-owl:wikiPageWikiLink |
|
inDataset |
|