External Parallel Sorting
External Parallel Sorting is a parallel sorting method designed for datasets too large to fit in main memory, where data is distributed across multiple external storage devices and sorted concurrently using coordinated I/O and inter-processor communication.
29
Publications
1.3K
Citations
62
Authors
31
Institutions
Publications per year
2017–2026
2
Parents
29
Naga K. Govindaraju, Jim Gray, Ritesh Kumar et al. · 2006 · 422 citations
GraFBoost: Using Accelerated Flash Storage for External Graph Analytics
Sang-Woo Jun, Andy Wright, Sizhuo Zhang et al. · 2018 · 90 citations
Alphasort: A cache-sensitive parallel external sort
Chris Nyberg, Zarka Cvetanovic, Jim Gray et al. · The VLDB Journal · 1995 · 75 citations
Mark H. Nodine, Jeffrey Scott Vitter · Journal of the ACM · 1995 · 69 citations · Full text
1–5 of 29
62
4
h-index
4
h-index
3
h-index
2
h-index
2
h-index
1–5 of 62
31
Microsoft (United States)
Redmond, United States
3 h-index
4 publications
599 citations
Duke University
Durham, United States
2 h-index
3 publications
91 citations
Northeastern University
Boston, United States
2 h-index
2 publications
46 citations
University of Wisconsin–Madison
Madison, United States
2 h-index
3 publications
325 citations
IEEE Computer Society
Washington, United States
1 h-index
1 publications
27 citations
Motorola (United States)
Schaumburg, United States
1 h-index
1 publications
69 citations
University of North Carolina Health Care
Chapel Hill, United States
1 h-index
3 publications
1.3K citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
1 h-index
1 publications
38 citations
1–8 of 31
Conference · 2 publications · 50 citations
2
h-index
JSS · 2 publications · 40 citations
2
h-index
1 publications · 13 citations
1
h-index
TKDE · 1 publications · 27 citations
1
h-index
1 publications · 19 citations
1
h-index
1–5