SS-tree Uses bounding spheres instead of bounding rectangles Motivated by range and kNN queries which are hyper-spheres Center of sphere is centroid of points Maintains total number of points in the subtree Higher fanout due to smaller storage requirements Considerable volume overlap Split axis is chosen based on variance Better than R*-trees