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

                                           

 

 

R + - tree
  • Mix of R-tree's data partitioning with K-d-B-tree's space-partitioning
  • Reduces dead space problem of K-d-B trees by using index rectangles
  • Reduces node overlap by making siblings disjoint
  • Data objects split into rectangles
 
  • Disjoint
 
  • Union gives original data object
  • Data object stored in mutliple leaves
  • Downward splitting
  • No space utilization guarantee