FastSort: a distributed single-input single-output external sort

Authors:
Betty Salzberg;Alex Tsukerman;Jim Gray;Michael Stuewart;Susan Uren;Bonnie Vaughan
Affiliations:
Northeastern University, Boston, Massachusetts;Tandem Computers, Cupertino, CA;Tandem Computers, Cupertino, CA;Tandem Computers, Cupertino, CA;Tandem Computers, Cupertino, CA;Tandem Computers, Cupertino, CA
Venue:
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Year:
1990

Citing 7
Cited 13

A measure of transaction processing power

Datamation
File structures: an analytic approach

File structures: an analytic approach
Sorting Large Files on a Backend Multiprocessor

IEEE Transactions on Computers
Merging sorted runs using large main memory

Acta Informatica
A low communication sort algorithm for a parallel database machine

VLDB '89 Proceedings of the 15th international conference on Very large data bases
The Art of Computer Programming Volumes 1-3 Boxed Set

The Art of Computer Programming Volumes 1-3 Boxed Set
GAMMA - A High Performance Dataflow Database Machine

VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases

Exploiting database parallelism in a message-passing multiprocessor

IBM Journal of Research and Development
Query evaluation techniques for large databases

ACM Computing Surveys (CSUR)
Fast algorithms for universal quantification in large databases

ACM Transactions on Database Systems (TODS)
High-performance sorting on networks of workstations

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
A Parallel Scheme Using the Divide-and-Conquer Method

Distributed and Parallel Databases
Sort vs. Hash Revisited

IEEE Transactions on Knowledge and Data Engineering
Speeding Up External Mergesort

IEEE Transactions on Knowledge and Data Engineering
Efficient Processing of Nested Fuzzy SQL Queries in a Fuzzy Database

IEEE Transactions on Knowledge and Data Engineering
Diag-Join: An Opportunistic Join Algorithm for 1:N Relationships

VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Memory-Adaptive External Sorting

VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Evaluation of Main Memory Join Algorithms for Joins with Set Comparison Join Predicates

VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Sing the truth about ad hoc join costs

The VLDB Journal — The International Journal on Very Large Data Bases
GPUTeraSort: high performance graphics co-processor sorting for large database management

Proceedings of the 2006 ACM SIGMOD international conference on Management of data

Quantified Score

Hi-index	0.00

Visualization

Abstract

External single-input single-output sorts can use multiple processors each with a large tournament replacement-selection in memory, and each with private disks to sort an input stream in linear elapsed time. Of course, increased numbers of processors, memories, and disks are required as the input file size grows. This paper analyzes the algorithm and reports the performance of an implementation.