A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Multidimensional Access Methods: Trees Have Grown Everywhere
1997
Very Large Data Bases Conference
Preserved Fulltext
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
dblp:conf/vldb/SellisRF97
fatcat:l6k4xg5u25h7hgwphuicc6kt7u