Speeding up External Mergesort

Abstract

External mergesort is normally implemented so that each run is stored contiguously on disk and blocks of data are read exactly in the order they are needed during merging. We investigate two ideas for improving the performance of external mergesort: interleaved layout and a new reading strategy. Interleaved layout places blocks from diierent runs in… (More)
DOI: 10.1109/69.494169

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.