Abstract
Sorting is one of the basic operations in any database system. In this paper we present two external sorting algorithms for hypercube database computers. The methods are based on partitioning of data according to partition values obtained through sampling of the data. One of the algorithms which is implemented at the HC16 database computer designed at The Norwegian Institute of Technology, is described in detail together with a performance evaluation and a presentation of some test results.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman: Data Structures and Algorithms, Addison Wesley Publishing Company, Inc. 1983.
Selim G. Akl: Parallel Sorting Algorithms, Academic Press, Inc. 1985.
Anon. et al.: A Measure of Transaction Processing Power, Datamation, April 1985.
C. K. Baru, O. Frieder, D. Kandlur and M. Segal: Join on a Cube: Analysis, Simulation and Implementation, Fifth International Workshop on Database Machines, Karuizawa, 1987.
Bjørn Arild Wangenstein Baugstø: Parallelle Sorteringsmetoder for Store Datamengder i en Hyperkubisk Databasemaskin, Division of Computer Systems and Telematics, The Norwegian Institute of Technology, University of Trondheim, (diploma thesis, in Norwegian).
Kjell Bratbergsengen, Rune Larsen, Oddvar Risnes and Terje Aandalen: A Neighbor Connected Processor Network for Performing Relational Algebra Operations, The Fifth Workshop on Computer Architecture for Non-numeric Processing, Pacific Grove, Ca, March 1980, SIGMOD Vol. X No. 4.
Kjell Bratbergsengen: Hashing Methods and Relational Algebra Operations, The 10th Conference on Very Large Data Bases, Singapore August 1984.
Kjell Bratbergsengen: Algebra Operations on a Parallel Computer — Performance Evaluation, Fifth International Workshop on Database Machines, Karuizawa, 1987.
Kjell Bratbergsengen: Hyperkuben Division of Computer Systems and Telematics, The Norwegian Institute of Technology, N-7034 Trondheim. March 1988 (in Norwegian).
Kjell Bratbergsengen and Torgrim Gjelsvik: The Development of the CROSS8 and HC16-186 Parallel (Database) Computers, Division of Computer Systems and Telematics, The Norwegian Institute of Technology, N-7034 Trondheim.
David DeWitt and Robert Gerber: Multiprocessor Hash-Based Join Algorithms, The 11th Conference on Very Large Data Bases, Stockholm Aug. 1985.
Jarle F. Greipsland og Bjørn Arild W. Baugstø: Sortering i hyperkuber, Project work during spring 1988, May 1988 (in Norwegian), Division of Computer Systems and Telematics, The Norwegian Institute of Technology, University of Trondheim.
Kjetil Gudmundsen: Strategies for Making a Fault Tolerant Database Management System on HC-16, Division of Computer Systems and Telematics, The Norwegian Institute of Technology, University of Trondheim, 1988.
Donald E. Knuth: Sorting and Searching. The Art of Computer Programming, Addison-Wesley Publishing Company, Inc. 1973.
Jai Menon: Sorting and Join Algorithms for Multiprocessor Database Machines, Database Machines, Modern Trends and Applications, Springer Verlag.
Steven R. Seidel and William L. George: Binsorting on Hypercubes with d-Port Communication, Department of Computer Science, Michigan Technological University, Houghton, ACM 1988.
Øystein Torbjørnsen: Turbo-C for the HC-16 Computer, Working paper no. 43, Division of Computing Systems and Telematics, The Norwegian Institute of Technology, August 1988.
Øystein Torbjørnsen: Communication in a Failsoft Hypercube Database Machine, Division of Computer Systems and Telematics, The Norweigan Institute of Technology, University of Trondheim, 1988.
Y. Yamane and R. Take: Parallel Partition Sort for Database Machines, Fifth International Workshop on Database Machines, Karuizawa, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baugstø, B.A.W., Greipsland, J.F. (1989). Parallel sorting methods for large data volumes on a hypercube database computer. In: Boral, H., Faudemay, P. (eds) Database Machines. IWDM 1989. Lecture Notes in Computer Science, vol 368. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51324-8_32
Download citation
DOI: https://doi.org/10.1007/3-540-51324-8_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51324-7
Online ISBN: 978-3-540-46197-5
eBook Packages: Springer Book Archive