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

                                           

 

 

Deletion
  • Find entry by searching
  • Delete entry
  • If under flow, delete leaf node and put entries into temporary set
  • Adjust MBRs of index entries of parent
  • Proceed in this manner from leaf to root
  • Re-insert orphan entries from temporary set
 
  • Orphan entries from higher levels must be inserted higher such that all leaves are on the same level
  • If under flow proceeds to root, height decreases by 1