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

                                           

 

 

Insertion
  • Data inserted at leaves
  • Which leaf ?
  • Start at root
  • Choose child requiring least volume enlargement
 
  • If tie, then child with least volume, then lesser number of children
  • If no over flow at leaf, insert
  • Otherwise, split and insert
  • Adjust tree by updating all index entries from leaf to root
  • If root splits, height increases by 1