Module 5: Disk-based Index Structures
  Lecture 22: SS-trees,SR-trees,P-trees
 

                                           

 

 

SR-tree
  • Uses both bounding spheres and bounding rectangles
  • Index node is intersection of these two
 
  • Tighter index
 
  • Implicitly stored