Example B+ Tree

• Search begins at root, and key comparisons direct it to a leaf (as in ISAM).

• Search for 5*, 15*, all data entries >= 24* ...

• Based on the search for 15*, we know it is not in the tree!

Root

17

24

30

2*

3*

5*

7*

14*

16*

19*

20*

22*

24*

27*

29*

33*

34*

38*

39*

13

Previous slide

Next slide

Back to first slide

View graphic version