The Rebound Sorter: An Efficient Sort Engine for Large Files.
T. C. Chen, Vincent Y. Lum, C. Tung:
The Rebound Sorter: An Efficient Sort Engine for Large Files.
VLDB 1978: 312-318@inproceedings{DBLP:conf/vldb/ChenLT78,
author = {T. C. Chen and
Vincent Y. Lum and
C. Tung},
editor = {S. Bing Yao},
title = {The Rebound Sorter: An Efficient Sort Engine for Large Files},
booktitle = {Fourth International Conference on Very Large Data Bases, September
13-15, 1978, West Berlin, Germany},
publisher = {IEEE Computer Society},
year = {1978},
pages = {312-318},
ee = {db/conf/vldb/ChenLT78.html},
crossref = {DBLP:conf/vldb/78},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
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.
Copyright © 1978 by The Institute of
Electrical and Electronic Engineers, Inc. (IEEE).
Abstract used with permission.
CDROM Version: Load the CDROM "Volume 1 Issue 4, VLDB '75-'88" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
Printed Edition
S. Bing Yao (Ed.):
Fourth International Conference on Very Large Data Bases, September 13-15, 1978, West Berlin, Germany.
IEEE Computer Society 1978
Contents
References
- [1]
- Donald E. Knuth:
The Art of Computer Programming, Volume III: Sorting and Searching.
Addison-Wesley 1973, ISBN 0-201-03803-X
- [2]
- ...
- [3]
- ...
- [4]
- ...
- [5]
- ...
- [6]
- ...
- [7]
- ...
- [8]
- ...
Copyright © Tue Mar 16 02:21:55 2010
by Michael Ley (ley@uni-trier.de)