BTree Behavior

The standard Tree Behavior has a problem causing add/delete based performance degredation bound by the size of the table. In a table of 1 million nodes a single add or delete can currently cause up to 2 million discreet operations. To reduce the effect of this degradation I propose introducing fragmentation and partitioning to the Tree table, thereby significantly reducing the overhead of destructive or additive operations.