Internal and tape sorting using the replacement-selection technique

Authors:
Martin A. Goetz
Affiliations:
Applied Data Research, Inc., Princeton, NJ
Venue:
Communications of the ACM
Year:
1963

Citing 3
Cited 5

A Sorting Problem

Journal of the ACM (JACM)
A high-speed sorting procedure

Communications of the ACM
A programming language

A programming language

Sorting

ACM Computing Surveys (CSUR)
Organization and structure of data on disk file memory systems for efficient sorting and other data processing programs

Communications of the ACM
Design and characteristics of a variable-length record sort using new fixed-length record sorting techniques

Communications of the ACM
Some improvements in the technology of string merging and internal sorting

AFIPS '64 (Spring) Proceedings of the April 21-23, 1964, spring joint computer conference
Two-way replacement selection

Proceedings of the VLDB Endowment

Quantified Score

Hi-index	48.25

Visualization

Abstract

A general technique for sequencing unsorted records is presented. The technique is shown to be applicable for the first stage of a generalized sort program (the formation of initial strings) as well as for sorting records within a memory storage (an internal sort). It is shown that given N records in memory storage, records are sequenced using 1+log2 N tests per record, that initial string lengths will average 2N for random input records, and that reading, writing and processing can be accomplished simultaneously if the computer permits such overlap.