The rebound sorter: an efficient sort engine for large files

Authors:
T. C. Chen;Vincent Y. Lum;C. Tung
Affiliations:
-;-;-
Venue:
VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
Year:
1978

Citing 0
Cited 7

Mapping Homogeneous Graphs on Linear Arrays

IEEE Transactions on Computers
An On-Chip Compare/Steer Bubble Sorter

IEEE Transactions on Computers
The Analysis and Design of Some New Sorting Machines

IEEE Transactions on Computers
A Tree Storage Scheme for Magnetic Bubble Memories

IEEE Transactions on Computers
The Parallel Enumeration Sorting Scheme for VLSI

IEEE Transactions on Computers
Parallel sorting machines: their speed and efficiency

AFIPS '81 Proceedings of the May 4-7, 1981, national computer conference
A "zero-time" VLSI sorter

IBM Journal of Research and Development

Quantified Score

Hi-index	0.01

Visualization

Abstract

Sorting plays an increasingly important role in determining the overall performance of data base systems. Described is a new sorting scheme, called the rebound sort, implementable on a variety of technologies, e.g., magnetic bubbles and charge-coupled devices. The sort engine based on this new sorting scheme accepts as input a sequence of records, sorts them, and outputs the sorted records automatically. The actual sorting time is completely overlapped with the input/output time.