External Memory Sorting

External Memory Sorting is an external memory algorithm that organizes data stored predominantly in secondary storage by minimizing input/output operations through efficient block-wise data access and arrangement, distinguishing itself from internal memory sorting methods by explicitly accounting for the hierarchical structure of memory and the high cost of disk transfers.

47

Publications

1.6K

Citations

106

Authors

61

Institutions

Publications per year

2017–2026

8

Authors

106

  1. JS
    Jeffrey Scott Vitter

    Duke University, United States

    7 publications · 362 citations

    7

    h-index

  2. PL
    Per-Åke Larson

    University of Waterloo, Canada

    3 publications · 80 citations

    3

    h-index

  3. DA
    D. A. W. Hutchinson

    University of Otago, New Zealand

    3 publications · 59 citations

    3

    h-index

  4. MT
    Michael T. Goodrich

    Johns Hopkins University, United States

    3 publications · 78 citations

    3

    h-index

  5. JB
    Jalil Boukhobza

    Université de Bretagne Occidentale, France

    2 publications · 38 citations

    2

    h-index

1–5 of 106

Venues

  1. Journal of the ACM

    JACM · 3 publications · 110 citations

    3

    h-index

  2. ACM SIGMOD Record

    3 publications · 65 citations

    3

    h-index

  3. IEEE Transactions on Computers

    2 publications · 60 citations

    2

    h-index

  4. ACM Journal of Experimental Algorithmics

    JEA · 2 publications · 72 citations

    2

    h-index

  5. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 1 publications · 27 citations

    1

    h-index

1–5