W3C home > Mailing lists > Public > semantic-web@w3.org > October 2014

Re: RDF Graphs

From: Kostis Kyzirakos <Kostis.Kyzirakos@cwi.nl>
Date: Mon, 27 Oct 2014 20:46:34 +0100
Message-ID: <544EA11A.4050102@cwi.nl>
To: semantic-web@w3.org

>     Formally, an RDF graph is a *set* of RDF triples, and an RDF
>     triple is a 3-element *sequence* comprising a subject which is an
>     IRI or a blank node, a property which is a IRI and an object which
>     is an IRI, a blank node or a literal; for definitions of 'blank
>     node' and 'literal', see
>     http://www.w3.org/TR/rdf11-concepts/#section-rdf-graph
>     So, long story short: an RDF graph is a set.

The first version of SPARQL implied bag semantics, but all theoretical
treatments of RDF use set semantics.
However, most RDF stores implement a variation of this model where RDF
graphs are bags of RDF triples.

Received on Monday, 27 October 2014 19:47:11 UTC

This archive was generated by hypermail 2.4.0 : Friday, 17 January 2020 19:49:26 UTC