Semantic Data
Abbreviation(s) or Acronym(s): None
Definition(s):
(noun) Data that, in its most fundamental form, is broken down into unique Nodes and unique Relationships between any two Nodes, where a Relationship is often represented as a Data Triplet — a Subject Node (a Source Node), a Predicate (a Relationship Descriptor), and an Object Node (a Target Node) — to control direction of the Relationship by loosely following English grammar structures; when Nodes and Relationships are tied together to form a data network, they can create any appropriate data structure, from something as simple as a point or line structure to more complex representations such as tree, graph, or network structures.
NOTE: The principle behind Semantic Data is that the more complex data structures associated with Information can only be exchanged by computers in a processable manner if such structures are broken down into a series of the most fundamental and repeatable mathematical constructs (i.e. Nodes and Relationships between Nodes). A very common standard for Semantic Data representations is that of the World Wide Web Consortia (W3C), which is the Resource Description Framework (RDF). The premise is, that by using such representations and standards, computers can quickly and efficiently exchange very complex information in a very simple and repeatable manner, thereby helping to achieve the original visions of a Semantic Web (a.k.a. Web 3.0), as envisioned by Tim Berners-Lee who invented the World Wide Web.