Multidimensional Access Methods: Trees Have Grown Everywhere

Timos K. Sellis, Nick Roussopoulos, Christos Faloutsos
1997 Very Large Data Bases Conference  
This paper is a survey of work and issues on multidimensional search trees. We provide a classification of such methods, we describe the related algorithms, we present performance analysis efforts, and finally outline future research directions. Multi-dimensional search trees and Spatial Access Methods, in general, are designed to handle spatial objects, like points, line segments, polygons, polyhedra etc. The goal is to support spatial queries, such as nearest neighbors queries (find all
more » ... within 10 miles from Washington D.C.), or range queries (find
dblp:conf/vldb/SellisRF97 fatcat:l6k4xg5u25h7hgwphuicc6kt7u