External Memory R-trees
External Memory R-Trees is a spatial indexing structure designed for efficiently managing and querying large multidimensional datasets stored in external memory, distinguished by its adaptation of the R-tree hierarchy to minimize I/O operations in disk-based systems.
22
Publications
3.9K
Citations
71
Authors
8
Institutions
Publications per year
2017–2026
0
22
Proceedings of the 27th International Conference on Very Large Data Bases
Peter M. G. Apers, Paolo Atzeni, Stefano Ceri et al. · 2001 · 845 citations
1–5 of 22
71
2
h-index
2
h-index
2
h-index
2
h-index
1 publications · 450 citations
1
h-index
1–5 of 71
8
Purdue University West Lafayette
West Lafayette, United States
2 h-index
4 publications
289 citations
Norwegian University of Science and Technology
Trondheim, Norway
1 h-index
1 publications
408 citations
Max Planck Society
Munich, Germany
1 h-index
2 publications
148 citations

University of Pisa
Pisa, Italy
1 h-index
1 publications
74 citations
Duke University
Durham, United States
1 h-index
1 publications
176 citations
Decision Sciences (United States)
Fort Walton Beach, United States
1 h-index
1 publications
127 citations

Vrije Universiteit Amsterdam
Amsterdam, The Netherlands
1 h-index
1 publications
29 citations
Max Planck Institute for Informatics
Saarbrücken, Germany
1 h-index
1 publications
74 citations
1–8 of 8
2 publications · 250 citations
2
h-index
1 publications · 447 citations
1
h-index
Repository · 1 publications · 38 citations
1
h-index
1 publications · 54 citations
1
h-index
Repository · 1 publications · 127 citations
1
h-index
1–5