- From: Richard Newman <r.newman@reading.ac.uk>
- Date: Thu, 20 Oct 2005 17:43:53 +0100
- To: Mailing Lists <list@thirdstation.com>
- Cc: semantic-web@w3.org
Mark, In theory (i.e., according to the RDF specs and theory), triples in a graph are a set. Thus, the RDF graph described by those triples contains one triple. In practice, checking for and removing duplicates is more or less easy; you may find that some stores permit duplicates (perhaps if they differ in source), while others will prevent their addition. SPARQL provides the DISTINCT keyword, which might be useful when dealing with some stores (though that's not its main use). -R On 20 Oct 2005, at 17:26, Mailing Lists wrote: > > Hi, > > If I am dumping data into a triple store and my data ends up having > duplicate triples how is a triple store supposed to handle the dupes? > > For example, if I try to insert these three triples: > > <isbn:0802130208> <dc:title> <"A Confederacy of Dunces"> > <isbn:0802130208> <dc:title> <"A Confederacy of Dunces"> > <isbn:0802130208> <dc:title> <"A Confederacy of Dunces"> > > Will I end up with three triples or one in the triplestore? > > Is there a specification for how a triple store is supposed to > treat this situation or does each follow its own rule? > > Thanks, > Mark > > .o0 Mark Donoghue > .o0 http://hdl.handle.net/10.1570/m.donoghue > > >
Received on Thursday, 20 October 2005 16:44:06 UTC