A Data Structure for Dynamic Range Queries

@article{Lueker1982ADS,
  title={A Data Structure for Dynamic Range Queries},
  author={George S. Lueker and Dan E. Willard},
  journal={Inf. Process. Lett.},
  year={1982},
  volume={15},
  pages={209-213}
}
Given a set of records in a k-dimensional space, an orthogonal range query (or simply a range query) is a request for the number of records in a specified k-dimensional box. More generally, in addition to a k-dimensional key KEY, each record may have a field VALUE, and we may wish to find the result of combining the VALUE fields of the records in the box under some operator q . For example, to find the minimum salary of people in some age range, we could let o be the operator ‘min’. If o is… CONTINUE READING
Highly Cited
This paper has 38 citations. REVIEW CITATIONS

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.