External Memory Searching
External Memory Searching is a computational method designed to locate specific data elements within datasets that reside predominantly in external storage, distinguished by its optimization of input/output operations to minimize access latency when the data size exceeds main memory capacity.
59
Publications
2.1K
Citations
126
Authors
72
Institutions
Publications per year
2017–2026
8
Parents
59
Optimal dynamic interval management in external memory
Lars Arge, Jeffrey Scott Vitter · 2002 · 139 citations
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 59
126
7
h-index
6
h-index
5
h-index
4
h-index
4
h-index
1–5 of 126
72
Duke University
Durham, United States
7 h-index
12 publications
785 citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
5 h-index
7 publications
178 citations
Mississippi State University
Starkville, United States
5 h-index
10 publications
351 citations

Aarhus University
Aarhus, Denmark
3 h-index
3 publications
102 citations

University of Helsinki
Helsinki, Finland
3 h-index
6 publications
113 citations
AT&T (United States)
Bedminster, United States
3 h-index
5 publications
411 citations
Korea Advanced Institute of Science and Technology
Daejeon, South Korea
3 h-index
5 publications
120 citations
Palo Alto Research Center
Palo Alto, United States
2 h-index
2 publications
41 citations
1–8 of 72
TKDE · 2 publications · 29 citations
2
h-index
2 publications · 68 citations
2
h-index
TODS · 2 publications · 50 citations
2
h-index
2 publications · 42 citations
2
h-index
1 publications · 16 citations
1
h-index
1–5