Data Structures for Range Searching.

Much research has recently been devoted to "multikey" searching problems. In this paper the particular multikey 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 available for solving the particular problem of range searching, and to display a set of general methods for attacking multikey searching problems. [ABSTRACT FROM AUTHOR]