Module 5: Disk-based Index Structures
Lecture 22:
SS-trees,SR-trees,P-trees
Structure and algorithms
Index node explicitly maintains both
Bounding sphere
Bounding rectangle
Center is weighted centroid of child nodes
Radius is minimum of maximum distances to
Bounding spheres of child nodes
Bounding rectangles of child nodes
Radius is tighter than SS-tree