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

                                           

 

 

R*-tree
  • Three optimizations over R-trees
 
  • Insertion
 
  • Splitting
 
  • Forced reinsertion when over flow
  • Instead of just volume, four parameters:
 
  • Volume wasted in a node ("dead space")
 
  • Volume of overlaps
 
  • Margin (i.e., sum of edges)
 
  • Space utilization