External Memory Join Algorithms
External Memory Join Algorithms is a class of algorithms designed to efficiently compute join operations on datasets that exceed the capacity of main memory by optimizing input/output operations between internal and external storage.
11
Publications
663
Citations
27
Authors
8
Institutions
Publications per year
2017–2026
2
Parents
11
XR-tree: indexing XML data for efficient structural joins
Haifeng Jiang, Hongjun Lü, Wei Wang et al. · 2004 · 216 citations
Li Fei-Fei, Bin Wu, Ke Yi et al. · 2016 · 150 citations · Full text
Jeffrey Scott Vitter · 1998 · 129 citations · Full text
1–5 of 11
27
Hong Kong University of Science and Technology, Hong Kong SAR China
4 publications · 209 citations
4
h-index
4
h-index
4
h-index
3
h-index
1
h-index
1–5 of 27
8

Hong Kong University of Science and Technology
Hong Kong, Hong Kong
5 h-index
11 publications
1.1K citations
University of Utah
Salt Lake City, United States
4 h-index
6 publications
258 citations

Shanghai Jiao Tong University
Shanghai, China
2 h-index
2 publications
160 citations
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
1 h-index
5 publications
80 citations
National University of Singapore
Singapore, Singapore
1 h-index
1 publications
216 citations
Duke University
Durham, United States
1 h-index
1 publications
129 citations
University of Southern California
Los Angeles, United States
1 h-index
2 publications
60 citations
University of Wisconsin–Madison
Madison, United States
1 h-index
1 publications
41 citations
1–8 of 8
Repository · 2 publications · 22 citations
2
h-index
Repository · 1 publications · 41 citations
1
h-index
TODS · 1 publications · 26 citations
1
h-index
1 publications · 23 citations
1
h-index
1–4