Abstract
The design of a parallel database computer is described. It contains 8 single board computers, each with a disk controller and disk. They communicate over a system of shared RAM, allowing fast communication without interference. The 8 computers are programmed and controlled from an IBM-compatible PC. The database computer is used for experimentation with relational algebra operations, sorting and numeric computations. In this paper we describe the methods used for doing relational operations, and test results are reported. The performance of the system did meet our expectations, and is quite good. The DeWitt join test was completed in 1.8 seconds. The system will be extended to 64 or 128 nodes and a brief description of the new interconnection network and an estimate of the expected performance is given.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Bitton, D. DeWitt and Turbyfill, Benchmarking Database Systems. A Systematic Approach, The 9th International Conference on Very Large Data Bases, Florence Oct. 1983.
Kjell Bratbergsengen, Rune Larsen, Oddvar Risnes and Terje Aandalen: A Neighbor Connected Processor Network for Performing Relational Algebra Operations, The papers of 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 Algbra Operations, The 10th Conference on Very Large Data Bases, Singapore Aug. 1984.
David DeWitt and Robert Gerber, Multiprocessor Hash-Based Join Algorithms, The 11th Conference on Very Large Data Bases, Stockholm Aug. 1985.
J.R. Goodman, An Investigation of Multiprocessor Structures and Algorithms for Database Management, Technical Report UCB/ERL M81/33 Electronic Research Lab., College of Engineering, UCB, May 1981.
M. Kitsuregawa, H. Tanaka and T. Moto-oka, Application of Hash to Data Base Machine and Its Architecture New Generation Computing, Vol. 1, No. 1, 1983.
Jai Menon, Sorting and Join Algorithms for Multiprocessor Database Machines Database Machines, Modern Trends and Applications, Springer-Verla; 1986.
G. Z. Qadah, The Equi-join Operation on a Multiprocessor Database Machine: Algorithms and the Evaluation of Their Performance Fourth International Workshop on Database Machines, Grand Bahama Islands 1985, Conference Proceedings Springer Verlag New York 1985.
A.K. Sood, M. Abdelguerfi and W. Shu, Hardware Implementation of Relational Algebra Operations. Database Machines, Modern Trends and Applications, Springer-Verlag 1986.
Stonebraker M. et al., The Design and Implementation of INGRES, TODS 2, sept. 1976.
TECHRA User Manual. Kongsberg Vaapenfabrikk avd. Trondheim, 1984.
P.Valduriez and G.Gardarin, Join and Semi-Join Algorithms for a Multiprocessor Database Machine, ACM Transactions on Database Systems 9, No 1, March 1984
Michael Ubell, The Intelligent Database Machine (IDM), Query Processing in Database Systems, Kim, Reiner & Batory; Eds., Springer Verlag 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Kluwer Academic Publishers, Boston
About this chapter
Cite this chapter
Bratbergsengen, K. (1988). Algebra Operations on a Parallel Computer — Performance Evaluation. In: Kitsuregawa, M., Tanaka, H. (eds) Database Machines and Knowledge Base Machines. The Kluwer International Series in Engineering and Computer Science, vol 43. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1679-4_30
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1679-4_30
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8948-7
Online ISBN: 978-1-4613-1679-4
eBook Packages: Springer Book Archive