Re: RDF Graphs

RDF Graphs are not bags, but sets of triples. 
SPARQL does have bag semantics, but that's not connected to this.

Axel

--
Prof. Dr. Axel Polleres
Institute for Information Business, WU Vienna
url: http://www.polleres.net/  twitter: @AxelPolleres

On 27 Oct 2014, at 12:46, Kostis Kyzirakos <Kostis.Kyzirakos@cwi.nl> wrote:

> 
>> 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.
> 
> Cheers,
> Kostis
> 

Received on Monday, 27 October 2014 21:16:39 UTC