W3C home > Mailing lists > Public > www-rdf-interest@w3.org > October 2004

Duplicate triples Re: RDF Graph

From: Charles McCathieNevile <charles@w3.org>
Date: Wed, 6 Oct 2004 17:50:10 -0400 (EDT)
To: algermissen@acm.org
Cc: "www-rdf-interest@w3.org" <www-rdf-interest@w3.org>
Message-ID: <Pine.LNX.4.55.0410061747530.23467@homer.w3.org>

On Wed, 6 Oct 2004, Jan Algermissen wrote:

>this is likely to be a silly question, but I seem to be unable to parse
>the anser from the RDF Recommendations.
>"An RDF graph, or simply a graph, is a set of RDF triples."
>(from RDF Semantics, 0.3 "Graph Definitions")
>Since the graph is a set it does not contain duplicate triples, yes?

I recall a discussion on this topic recently. I believe that someone who
knows the spec better than I do said the formal definition doesn't prohibit
redundant triples, so a conformant program would not necessarily delete

If I could recall when I discussed it I might be able to provide an answer
with more supporting documentation, but I can't seem to find a trace of it

>A conforming software (for managing RDF graphs) would automatically
>delete duplicates, yes?


Received on Wednesday, 6 October 2004 21:50:10 UTC

This archive was generated by hypermail 2.3.1 : Wednesday, 7 January 2015 15:07:53 UTC