Nested sets performance ?

As I understand, every insertion into the tree involves updating every other node to the right. I fear that a simple row insertion on a record set for large volumes of data will impair performance. Performance is directly related to the number of rows.

Using the adjacency list model will only require adding a row with parent relationship. But, perhaps not as efficient for building my tree.

I am wondering whether I can sub-divide my tree by some branch id. So in essence have several trees acting as one big tree. That way adding a node will only result in updates to the relevant sub-tree.

Help. Any advice on high-performance binary trees would be greatly appreciated.

Cheers
Simon. Received on Thu Feb 07 2002 - 12:38:58 CET