- From: Aaron Swartz <me@aaronsw.com>
- Date: Wed, 18 Jul 2001 11:54:37 -0500
- To: Dan Connolly <connolly@w3.org>
- Cc: Graham Klyne <Graham.Klyne@Baltimore.com>, RDF core WG <w3c-rdfcore-wg@w3.org>
On Thursday, July 12, 2001, at 02:02 AM, Dan Connolly wrote: > from aaron: > > |I think all parsers should spit out > |equivalent genids for the same document -- the spec should > |mandate the genid to use. > > I'm pretty sure there is no algorithm for coming up > with genids that works; i.e. there's no algorithm > for sorting the triples in a graph: you can't treat a graph > as if the edges didn't (sometimes) cross. This isn't necessary -- you only need to say something like they're numbered based on the location of the XML element that defined them, or that they random UUIDs or something. -- [ "Aaron Swartz" ; <mailto:me@aaronsw.com> ; <http://www.aaronsw.com/> ]
Received on Wednesday, 18 July 2001 12:55:12 UTC