Module 4: Index Structures
  Lecture 13: Index structure
 

                                           

 

 

B-tree
  • A B-tree of order has the following properties:
 
  • Leaf nodes are in same level (balanced) and contain no data
 
  • Internal nodes (not the root) have between and 2 keys
 
  • Root has at least 1 key
 
  • An internal node with keys have children
 
  • Child pointers in leaf nodes are null
  • Branching factor =