Module 5: Disk-based Index Structures
  Lecture 20: R-trees
 

                                           

 

 

Splitting a node
  • Split a node with entries into two nodes having at least entries each