Once I read http://www.dbmsmag.com/9603d06.html I pretty much stopped using recursion to build any trees, so... if performance was the key situation issue here, I'd question having a tree based on node / parentNode "taxonomy"(*), anyhow (whether it involves UUIDs or not!). But that's hardly relevant to a discussion on "UUIDs (for or against)", I guess ;-)
I'm still interested to know how the "build a key out of a hash of the node and its depth in the tree" (or whatever it is... I delete these posts as I read them, so forget the details) copes with moving a node to elsewhere in the tree? Cheers. Adam Cameron Application Developer Straker Interactive [EMAIL PROTECTED] Fax + 64 9 3605870 DDI +64 4 4965664 (*) what is it with IT people and their - misused - buzzwords? What would be wrong with saying "structure". ---------------------------------------------------------- You are subscribed to cfcdev. To unsubscribe, send an email to [EMAIL PROTECTED] with the word 'unsubscribe cfcdev' in the message of the email. CFCDev is run by CFCZone (www.cfczone.org) and supported by Mindtool, Corporation (www.mindtool.com).
