RDF Triple
An RDF Triple is a three-tuple record of URI References (in the RDF standard) that define a subject, a predicate and an object.
- Context:
- It can include an IRI.
- It can (typically) represent a directed edge in an RDF Graph.
- Example(s):
<rdf:Description rdf:about="#HarryPotter"> <hasPet rdf:resoruce="#Hedwig"/><hasEmail>harry.potter@howards.net</hasEmail></rdf:Description>, where#HarryPotterand#Hedwigare fragment identifiers.- …
- Counter-Example(s):
- an OWL Statement.
- an XML Statement.
- See: RDF Vocabulary, RDF.
References
2009
- (Wikipedia, 2009)
- … A collection of RDF statements intrinsically represents a labeled, directed multi-graph. As such, an RDF-based data model is more naturally suited to certain kinds of knowledge representation than the relational model and other ontological models traditionally used in computing today. However, in practice, RDF data is often persisted in relational database or native representations also called Triple stores, or Quad stores if context (i.e. the named graph) is also persisted for each RDF triple. [2]
2004
- http://www.w3.org/TR/rdf-concepts/#section-data-model
- The underlying structure of any expression in RDF is a collection of triples, each consisting of a subject, a predicate and an object. A set of such triples is called an RDF graph (defined more formally in section 6). This can be illustrated by a node and directed-arc diagram, in which each triple is represented as a node-arc-node link (hence the term "graph").
Each triple represents a statement of a relationship between the things denoted by the nodes that it links. Each triple has three parts: a subject, an object, and a predicate (also called a property) that denotes a relationship.
The direction of the arc is significant: it always points toward the object.
The nodes of an RDF graph are its subjects and objects.
The assertion of an RDF triple says that some relationship, indicated by the predicate, holds between the things denoted by subject and object of the triple. The assertion of an RDF graph amounts to asserting all the triples in it, so the meaning of an RDF graph is the conjunction (logical AND) of the statements corresponding to all the triples it contains. A formal account of the meaning of RDF graphs is given in [RDF-SEMANTICS].
- The underlying structure of any expression in RDF is a collection of triples, each consisting of a subject, a predicate and an object. A set of such triples is called an RDF graph (defined more formally in section 6). This can be illustrated by a node and directed-arc diagram, in which each triple is represented as a node-arc-node link (hence the term "graph").
- http://www.w3.org/TR/rdf-concepts/#section-triples
- An RDF triple contains three components:
- the subject, which is an RDF URI reference or a blank node
- the predicate, which is an RDF URI reference.
- the object, which is an RDF URI reference, a literal or a blank node
- An RDF triple is conventionally written in the order subject, predicate, object.
The predicate is also known as the property of the triple.
- An RDF triple contains three components: