Module 5: Disk-based Index Structures
  Lecture 17: Disk-based Index Structures
 

                                           

 

 

Algorithms
  • Insertion
 
  • If no space in leaf bucket, choose a split line and create two buckets
 
  • Cycle through dimensions.
 
  • Dimension with largest range.
 
  • Corresponding bucket entries are updated in parent
 
  • May lead to parent over flow and so on
 
  • Height increased only at root
  • Deletion
 
  • Many deletions may result in very low space utilization
 
  • Find another page that is joinable
 
  • Same parent.
 
  • Forms a hyper-rectangle.
 
  • Does not over flow
  • Point queries
 
  • Recursively nd child region, starting from root