Worst-Case Search Depth II

• For any level d of a B-Tree, the minimum number of descendants extending from that level is . 2 ?m/2? d-1

• For a tree with N keys in its leaves, we have

N? 2 ?m/2? d-1

? d ? 1 + log?m/2? (N/2)

• For m= 512 and N= 1,000,000, we thus get

d ? 3.37

Previous slide

Next slide

Back to first slide

View graphic version