External Memory Range Searching
External Memory Range Searching is a computational framework within the broader class of range searching methods that is specifically designed to efficiently process geometric or multidimensional queries on datasets too large to fit in main memory by optimizing input/output operations between internal and external storage.
15
Publications
724
Citations
27
Authors
15
Institutions
Publications per year
2017–2026
0
15
Optimal dynamic interval management in external memory
Lars Arge, Jeffrey Scott Vitter · 2002 · 139 citations
Pankaj K. Agarwal, Siu-Wing Cheng, Yufei Tao et al. · 2009 · 96 citations
1–5 of 15
27
5
h-index
5
h-index
5
h-index
Korea Advanced Institute of Science and Technology, South Korea
2 publications · 90 citations
2
h-index
Korea Advanced Institute of Science and Technology, South Korea
2 publications · 90 citations
2
h-index
1–5 of 27
15
Duke University
Durham, United States
5 h-index
10 publications
866 citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
4 h-index
4 publications
120 citations
Korea Advanced Institute of Science and Technology
Daejeon, South Korea
3 h-index
6 publications
224 citations

University of Hong Kong
Pok Fu Lam, Hong Kong
1 h-index
1 publications
96 citations

Hong Kong University of Science and Technology
Hong Kong, Hong Kong
1 h-index
2 publications
192 citations
Purdue University West Lafayette
West Lafayette, United States
1 h-index
3 publications
42 citations
National Tsing Hua University
Hsinchu, Taiwan
1 h-index
1 publications
14 citations
Louisiana State University
Baton Rouge, United States
1 h-index
1 publications
14 citations
1–8 of 15
TSWJ · 1 publications · 11 citations
1
h-index
PVLDB · 1 publications · 64 citations
1
h-index
1 publications · 10 citations
1
h-index
TODS · 1 publications · 26 citations
1
h-index
1–4