Work

Data Structures for Range Searching

Year: 1979

Type: article

Abstract: 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.

Source: ACM Computing Surveys

DOI: 10.1145/356789.356797

Authors: Jon Louis Bentley, Jerome H. Friedman

Institutions: Carnegie Mellon University, SLAC National Accelerator Laboratory, Stanford University

Language: English

Topic: Algorithms and Data Compression

Subfield: Theoretical Computer Science

Field: Mathematics

Domain: Physical Sciences

Open Access status: bronze

OpenAlex ID: W2092276439

FWCI: 8.311

Cites: 33

Cited by: 630

Related to: 10