Hierarchical Data Storage

[Ruslan Zasukhin]

On 12/2/07 6:39 PM, "Trevor DeVore" <lists at mangomultimedia.com> wrote:

Hi Trevor,

>> While reading this article, I also have think about:
>>     if its possible to use integer values with some STEP > 1
>>     then may be Add of node will be faster.
>>     or use double values instead of integers...
> 
> I thought about using double values as well.  Looking at how updates
> are performed in the modified preorder tree traversal algorithm it
> seems to me that adding child nodes can potentially invalidate data
> in many records that aren't part of the current hierarchy.  If I am
> understanding the concept correctly, this seems like a bad thing if
> you have lots of clients working on parts of the tree.
> 
> Using doubles to at least isolate the tree connected to each root
> node seems like it could solve that issue for some projects.

I think should exists only one root.

May be I have not think deeply yet, but it seems to me if AddNode() touch
not ALL right nodes but only nearest nodes, then this improve concurrency.

-- 
Best regards,

Ruslan Zasukhin
VP Engineering and New Technology
Paradigma Software, Inc

Valentina - Joining Worlds of Information
http://www.paradigmasoft.com

[I feel the need: the need for speed]