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: a1 < x < a2
  • B+tree: a1 <= x <= a2
  • Why?
    • because all data for partition values must be in the lowest level of the tree