Module 5: Disk-based Index Structures
  Lecture 21: R-tree Variants
 

                                           

 

 

Forced reinsertion
  • When over flow occurs, do not split immediately
  • Choose p entries to be re-inserted
 
  • Empirically, = 30%
  • Which entries?
  • For each entry, compute distance of its centroid to centroid of node
 
  • Remove from closest to farthest (close reinsert)
 
  • Reinsertion will not increase volume of node
 
  • Remove from farthest to closest (far reinsert)
 
  • Likely to be reinserted at some other node
 
  • Not clear which one better
 
  • Experimentally, close reinsert better
  • Done only once at each level to avoid infinite loop