Parallel sort and join for high speed database machine operations

Authors:
Mamoru Maekawa
Affiliations:
University of Tokyo, Tokyo, Japan
Venue:
AFIPS '81 Proceedings of the May 4-7, 1981, national computer conference
Year:
1981

Citing 3
Cited 1

Sorting on a mesh-connected parallel computer

Communications of the ACM
Parallel Processing with the Perfect Shuffle

IEEE Transactions on Computers
Sorting networks and their applications

AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference

A database machine based on the data distribution approach

AFIPS '84 Proceedings of the July 9-12, 1984, national computer conference and exposition

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a parallel joining and sorting algorithm that completes in about log N steps for N records. The algorithm is intended for large database systems. The algorithm and its required processor interconnection are simple and realistic. Thus, a performance improvement of three to four orders of magnitude can be realistically expected by applying this algorithm to database machines. Analysis is primarily made by simulations.