Paper Info
Title
Foundations for Faster External Sorting (Extended Abstract)
Abstract
The availability of large main memories and the new technologies for disk drives have modified the models for external sorting and have renewed interest in their study. We investigate the replacement-selection paradigm for external sorting. We focus on the performance of the merge phase when given random files and specially when given nearly sorted files since such files are common in practice. In particular, we demonstrate that, during the merge phase, the floating-buffers technique not only reduces the sorting time by fully overlapping I/O and saving seeks, but also it profits significantly from existing order in the input. We also propose a new algorithm for computing a feasible reading sequence for floating buffers that improves upon previous algorithms.
Year
DOI
Venue
1994
10.1007/3-540-58715-2_142
FSTTCS
Keywords
Field
DocType
faster external,extended abstract,profitability
Discrete mathematics,Computer science,Theoretical computer science,External sorting,Distributed computing
Conference
ISBN
Citations 
PageRank 
3-540-58715-2
2
1.00
References 
Authors
5
2
Name
Order
Citations
PageRank
vladimir estivillcastro1903107.50
Derick Wood21693378.95