Data Structures for Range Searching
Jon Louis Bentley, Jerome H. Friedman · ACM Computing Surveys · 1979
Much research has recently been devoted to "multikey" searching problems.In this paper the partmular multlkey problem of range searching Is investigated and a number of data structures that have been proposed as solutions to this problem are surveyed.The purposes of this paper are to bring together a collection of widely scattered results, to acquaint the reader with the structures currently avadable for solving the particular problem of range searching, and to display a set of general methods for attacking multikey searching problems.
Cited by 622 works. doi:10.1145/356789.356797 Open-access PDF
Authors
References
- The Art of Computer Programming
- Multidimensional binary search trees used for associative searching
- An Algorithm for Finding Best Matches in Logarithmic Expected Time
- Quad trees a data structure for retrieval on composite keys
- A Nonparametric Estimate of a Multivariate Density Function
- Multidimensional Searching Problems
- Multidimensional Binary Search Trees in Database Applications
- An Algorithm for Finding Nearest Neighbors
- Molecular Model-Building by Computer
- Multidimensional divide-and-conquer