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

                                           

 

 

Exhaustive algorithm
  • Examine all possibilities
 
  • Number of possibilities is exponential in (and M )
  • Choose the best
  • Optimal
  • Too slow and impractical