4 ms·
> As for writes, a new key could go anywhere in the index This forces index tree rebalancing to occur on many (even most) writes, which is hugely detrimental t
by bza 11y ago
> As for writes, a new key could go anywhere in the index
This forces index tree rebalancing to occur on many (even most) writes, which is hugely detrimental to performance.
- lmm 11y agoWhich tree structure is this for? Many tree structures (e.g. the classic red-black tree) perform much better (doing less rebalancing) for randomized inserts than for ordered ones.