External Memory Traversal Algorithms is a class of algorithms designed to efficiently process and navigate data structures stored in external memory, distinguished by their optimization of input/output operations during traversal to minimize access costs when data exceeds internal memory capacity.
20
Publications
1.3K
Citations
36
Authors
23
Institutions
Publications per year
2017–2026
0
Parents
Publications
20
The opportunities and challenges of exascale computing
Margaret J. Wright · 2010 · 181 citations
Comparing Hierarchical Data in External Memory
Sudarshan S. Chawathe · 1999 · 181 citations
On external memory graph traversal
Adam L. Buchsbaum, Michael H. Goldwasser, Suresh Venkatasubramanian et al. · 2000 · 110 citations
1–5 of 20
Authors
36
- LA
4
h-index
- JS
3
h-index
- RD
2
h-index
- DA
2
h-index
- UM
2
h-index
1–5 of 36
Institutions
23
Duke University
Durham, United States
3 h-index
3 publications
282 citations
Max Planck Institute for Informatics
Saarbrücken, Germany
3 h-index
8 publications
321 citations
Karlsruhe University of Education
Karlsruhe, Germany
2 h-index
2 publications
90 citations
Carleton University
Ottawa, Canada
2 h-index
3 publications
138 citations
Purdue University West Lafayette
West Lafayette, United States
2 h-index
2 publications
161 citations
Max Planck Society
Munich, Germany
2 h-index
4 publications
256 citations
Aarhus University
Aarhus, Denmark
2 h-index
2 publications
79 citations
University of Maryland, College Park
College Park, United States
1 h-index
1 publications
181 citations
1–8 of 23
Venues
- Algorithmica
3 publications · 284 citations
3
h-index
- BRICS Report Series
2 publications · 55 citations
2
h-index
- Foundations and Trends® in Theoretical Computer Science
1 publications · 127 citations
1
h-index
- The Scientific World JOURNAL
TSWJ · 1 publications · 11 citations
1
h-index
- Software Practice and Experience
1 publications · 11 citations
1
h-index
1–5