Skip to main content

Envisioning is an emerging technology research institute and advisory.

LinkedInInstagramGitHub

2011 — 2026

research
  • Reports
  • Newsletter
  • Methodology
  • Origins
  • Vocab
services
  • Research Sessions
  • Signals Workspace
  • Bespoke Projects
  • Use Cases
  • Signal Scanfree
  • Readinessfree
impact
  • ANBIMAFuture of Brazilian Capital Markets
  • IEEECharting the Energy Transition
  • Horizon 2045Future of Human and Planetary Security
  • WKOTechnology Scanning for Austria
audiences
  • Innovation
  • Strategy
  • Consultants
  • Foresight
  • Associations
  • Governments
resources
  • Pricing
  • Partners
  • How We Work
  • Data Visualization
  • Multi-Model Method
  • FAQ
  • Security & Privacy
about
  • Manifesto
  • Community
  • Events
  • Support
  • Contact
  • Login
ResearchServicesPricingPartnersAbout
ResearchServicesPricingPartnersAbout
  1. Home
  2. Vocab
  3. Triple

Triple

A subject-predicate-object data structure encoding relationships in knowledge graphs.

Year: 1999Generality: 450
Back to Vocab

A triple is the fundamental unit of data representation in RDF (Resource Description Framework) and semantic web technologies. It encodes a single factual statement as three components: a subject (the entity being described), a predicate (the relationship or property), and an object (the value or related entity). For example, the statement "Alice knows Bob" becomes a triple where "Alice" is the subject, "knows" is the predicate, and "Bob" is the object. This deceptively simple structure allows arbitrarily complex networks of facts to be expressed as collections of atomic statements, forming the backbone of knowledge graphs.

Triples are stored in specialized databases called triple stores, which are optimized for graph traversal and relationship queries. The SPARQL query language was developed specifically to retrieve and manipulate triple-based data, allowing systems to ask questions like "find all people Alice knows who also know Carol." Because each triple can be uniquely identified and linked to others, large collections of triples naturally form directed graphs where nodes represent entities and edges represent predicates. This graph structure makes it straightforward to merge datasets from different sources, since triples from separate knowledge bases can be combined as long as they share common identifiers.

In machine learning and AI, triples have become central to knowledge graph embedding methods, where the goal is to learn dense vector representations of entities and predicates that capture the relational structure of the graph. Models such as TransE, RotatE, and ComplEx operate directly on triple-formatted data, learning to predict missing links by scoring candidate triples. These embeddings can then enrich downstream tasks like question answering, entity disambiguation, and recommendation systems with structured world knowledge.

The practical importance of triples extends to large-scale industrial knowledge graphs such as Google's Knowledge Graph, Wikidata, and Freebase, all of which store billions of facts in triple form. As language models increasingly incorporate structured knowledge retrieval, the triple remains a critical interface between symbolic knowledge representations and neural systems, bridging the gap between human-readable facts and machine-learnable representations.

Related

Related

Knowledge Graph
Knowledge Graph

A graph-structured representation of entities and their semantic relationships.

Generality: 759
Graph
Graph

A data structure of nodes and edges used to model relational data in AI.

Generality: 871
Trigrams
Trigrams

A sequence of three consecutive tokens used in language modeling and NLP.

Generality: 420
Embedding
Embedding

A dense vector representation that encodes semantic relationships between discrete items.

Generality: 875
Knowledge Representation
Knowledge Representation

Formal methods AI systems use to encode and reason over structured world knowledge.

Generality: 841
Graph Theory
Graph Theory

Mathematical study of node-edge structures used to model complex relational data.

Generality: 871