Obviously, if the key represents uniquely the node and its relationship to other nodes then moving that node requires that the key change. However, this is not an issue because in taxonomies a node's meaning is dependent on its hierarchical relationship to other nodes. Thus, one could argue that it is in fact impossible to move a node in a taxonomy as nodes can only be created and destroyed.

-Matt

On Tuesday, June 17, 2003, at 08:30 PM, Adam Cameron wrote:

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).


----------------------------------------------------------
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).

Reply via email to