Module 5: Disk-based Index Structures
  Lecture 18: General Framework
 

                                           

 

 

Range searching
  • Query point and a distance radius
  • Can be found by region intersection
 
  • Region C is unnecessarily searched
 
  • Extra space increases with dimensionality
  • Compute minimum and maximum distances to regions
 
  • If minimum (C,D,I,L,K), no point in answer set-prune
 
  • If maximum (F), all points in answer set-report
 
  • Otherwise (A,B,E,G,H,J), not sure-recurse into the region