R-tree Multi-dimensional B+-tree Can store hyper-dimensional points, lines, shapes, etc. Objects bounded by a hyper-dimensional minimum bounding rectangle (MBR) or minimum bounding box (MBB) Space utilization guarantee Multiple search paths due to non-disjoint objects