External Memory Search Trees is a type of search tree data structure designed for efficiently managing and querying large datasets stored in external memory, distinguished by its optimization of block-based I/O operations to minimize the number of disk accesses during search, insertion, and deletion operations.
18
Publications
918
Citations
36
Authors
24
Institutions
Publications per year
2017–2026
1
Publications
18
Jeffrey Scott Vitter · 1998 · 129 citations · Full text
On external memory graph traversal
Adam L. Buchsbaum, Michael H. Goldwasser, Suresh Venkatasubramanian et al. · 2000 · 110 citations
1–5 of 18
Authors
36
- UM
2
h-index
- DA
2
h-index
- JS
2
h-index
- PF
2
h-index
- RD
2
h-index
1–5 of 36
Institutions
24
University of Hong Kong
Pok Fu Lam, Hong Kong
2 h-index
6 publications
66 citations
Carleton University
Ottawa, Canada
2 h-index
3 publications
157 citations
AT&T (United States)
Bedminster, United States
2 h-index
4 publications
348 citations
Max Planck Society
Munich, Germany
2 h-index
4 publications
256 citations
Duke University
Durham, United States
2 h-index
2 publications
190 citations
University of Pisa
Pisa, Italy
2 h-index
2 publications
183 citations
Max Planck Institute for Informatics
Saarbrücken, Germany
2 h-index
3 publications
146 citations
Karlsruhe University of Education
Karlsruhe, Germany
2 h-index
2 publications
90 citations
1–8 of 24
Venues
- Algorithmica
3 publications · 194 citations
3
h-index
- Discrete Applied Mathematics
1 publications · 61 citations
1
h-index
- Foundations and Trends® in Theoretical Computer Science
1 publications · 127 citations
1
h-index
- Arrow@dit (Dublin Institute of Technology)
Repository · 1 publications · 54 citations
1
h-index
- Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06
Conference · 1 publications · 36 citations
1
h-index
1–5