Abstract
This paper proposes parallel join and sorting algorithms which complete in steps close to log2N for N records. The algorithms are intended for data base machines. The algorithms and the required interconnection are simple and realistic. The application of the algorithms can bring a performance improvement of three to four orders of magnitude over conventional sequential data base management systems. The analysis is primarily made by simulations.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Batcher K. E. (1968). Sorting Networks and Their Applications. 1968 SJCC, AFIPS Proc., Vol. 32, Washington, D.C., Thompson. 1968, pp. 307–314.
Bollobás B. (1978). Extremal Graph Theory. Academic Press. 1978.
Harary F. and Palmer E. M. (1973). Graphical Enumeration. Academic Press, New York. 1973.
Knuth D. E. (1973). The Art of Computer Programming, Vol. 3, Sorting and Searching. Addison-Wesley. 1973.
Okada Y. Tajima H., and Mori R. (1976). A Novel Multiprocessor Array. Second Symposium on Micro Architecture. North-Holland Publishing, Co. 1976.
Stone H. S. (1971). Parallel Processing with the Perfect Shuffle. IEEE Trans. on Computers, Vol. 1, C-20, No. 2. Feb. 1971, pp.153–161.
Thompson C. D., and Kung H. T. (1977). Sorting on a Mesh Connected Parallel Computer. Comm. ACM, Vol. 20, No. 4. April 1977, pp.263–271.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maekawa, M. (1982). Parallel join and sorting algorithms. In: Yao, S.B., Kunii, T.L. (eds) Data Base Design Techniques II:. DBDT 1979. Lecture Notes in Computer Science, vol 133. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-11215-4_3
Download citation
DOI: https://doi.org/10.1007/3-540-11215-4_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11215-0
Online ISBN: 978-3-540-39054-1
eBook Packages: Springer Book Archive