Range Trees
Range Trees is a data structure that organizes multidimensional points hierarchically through nested balanced binary search trees to enable efficient orthogonal range queries.
67
Publications
2.8K
Citations
178
Authors
92
Institutions
Publications per year
2017–2026
8
67
A data structure for orthogonal range queries
George S. Lueker · 1978 · 209 citations
Efficient worst-case data structures for range searching
Jon Bentley, Hermann Maurer · Acta Informatica · 1980 · 177 citations
Haibo Hu, Dik Lun Lee · IEEE Transactions on Knowledge and Data Engineering · 2006 · 119 citations
Distributed Segment Tree: Support of Range Query and Cover Query over DHT.
Changxi Zheng, Guobin Shen, Shipeng Li et al. · 2006 · 114 citations
1–5 of 67
178
3
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 178
92

Hong Kong University of Science and Technology
Hong Kong, Hong Kong
4 h-index
5 publications
382 citations
University of California San Diego
San Diego, United States
3 h-index
4 publications
174 citations
University of California, Irvine
Irvine, United States
3 h-index
3 publications
244 citations
NEC (United States)
Irving, United States
3 h-index
10 publications
162 citations

University of Amsterdam
Amsterdam, The Netherlands
2 h-index
2 publications
29 citations
Duke University
Durham, United States
2 h-index
5 publications
138 citations

University of Minnesota
Minneapolis, United States
2 h-index
4 publications
968 citations
Carnegie Mellon University
Pittsburgh, United States
2 h-index
3 publications
367 citations
1–8 of 92
TKDE · 6 publications · 356 citations
6
h-index
3 publications · 206 citations
3
h-index
3 publications · 132 citations
3
h-index
Conference · 2 publications · 115 citations
2
h-index
FGCS · 2 publications · 43 citations
2
h-index
1–5