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

                                           

 

 

Structure
  • Balanced
  • Index entry is a hyper-rectangle of dimensions speci ed by intervals.
  • Intervals are of the form [a,b]
  • Internal node contains index entries and child pointers
  • Leaf node contains index entries and data pointers
 
  • Leaf node index is an MBR for the actual data object
  • (M,m) R-tree
 
  • Maximum entries per node
 
  • Minimum entries per node (2 for root)