About us
Services
Products
Work
Contact
Feedback
In Focus
Flash XML slideshow
Database training
2.3.07. Properties of B+ trees
Balanced
All leaf nodes at same level
Record search takes same time for every record
Partitioning needs to be comprehensive
B-tree: a
1
< x < a
2
B+tree: a
1
<= x <= a
2
Why?
because all data for partition values must be in the lowest level of the tree
‹ 2.3.06. B+ trees
up
2.3.08. B+ tree operations ›
s5 slideshow