Properties of B+-trees

• every page contains at most 2m items

• every page, with the exception of the root, contains at least m items

• leaf pages form a dense index and are at the same depth

2 5 7 8

13 14 15 18

22 24

26 27 28

32 35 38

40 42 45 46

13 22

32 40

26

if primary index then pointer to tuple for 2

else (if secondary index) pointer to bucket for 2

Previous slide

Next slide

Back to first slide

View graphic version