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

                                           

 

 

Linear algorithm
  • Seeds are chosen differently
  • For each dimension, choose entries with highest minimum and lowest maximum
  • Normalize the difference by the total range along the dimension
  • Choose the entries with the largest difference as the seeds
  • Rest of the algorithm is same as quadratic