(STR): Another variation of Nearest-X, that estimates the total number of leaves required as , the required split factor in each dimension to achieve this as , then repeatedly splits each dimensions successively into equal sized partitions using 1-dimensional sorting. The resulting pages, if they occupy more than one page, are again bulk-loaded using the same algorithm. For point data, the leaf nodes will not overlap, and "tile" the data space into approximately equal sized pages. Overlap Minimizing Top-down (OMT): Improvement over STR using a top-down approach which minimizes overlaps between slices and improves query performance. Priority R-tree See also Segment tree Interval tree – A degenerate R-tree for one dimension (usually time). K-d tree Bounding volume hierarchy Spatial index GiST References External links