Skip to main content
SpringerLink
Log in

Control of bottlenecks in a network database machine

  • Computer Architecture, Concurrency, Parallelism, Communication And Networking
  • Conference paper
  • First Online:
Advances in Computing and Information — ICCI '90 (ICCI 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 468))

Included in the following conference series:

  • 135 Accesses

Abstract

An analysis of various response times for a proposed network multiprocessor database machine is given in this paper. The insights gained should lead to better database machine designs. Our systems is based on a principle of "shared-nothing" and aims at supporting large database applications by using parallelism. Our research shows that a highly parallel network multiprocessor DBM should be able to solve the I/O, data processing, and data transfer bottlenecks. A key to overcoming these problems is eliminating the irrelevant data retrieved by the query at each processing stage. For this, we consider both software and hardware techniques, not the use of a multiprocessor architecture alone.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W.W. Armstrong, T.A. Marsland, M. Olafsson and J. Schaeffer, Solving Equations of Motion on a Virtual Tree Machine, SIAM J. of Sci. and Stat. Comp. 8(1), s59–s72.

    Google Scholar 

  2. K. Bratbergsengen, Hashing Methods and Relational Algebra Operations, Proc. of the 1984 VLDB Conference, Singapore, August, 1984, 323–333.

    Google Scholar 

  3. D.J. DeWitt, R.H. Gerber, M.L. Heytens, K.B. Kumar and M. Muralikrishna, Multiprocessor Hash-Based Join Algorithms, Proc. of the 1985 VLDB Conference, Stockholm, August, 1985, 151–164.

    Google Scholar 

  4. D.J. DeWitt, R.H. Gerber, G. Graefe, M.L. Heytens, K.B. Kumar and M. Muralikrishna, GAMMA — A High Performance Dataflow Database Machine, Proc. of the 1986 VLDB Conference, Tokyo, August, 1986, 228–237.

    Google Scholar 

  5. D.J. DeWitt, S. Ghandeharizadeh and D. Schneider, A Performance Analysis of the GAMMA database Machine, Proc. of the 1988 SIGMOD Conference, Chicago, 1988, 350–360.

    Google Scholar 

  6. S. Fustimi, M. Kitsuregawa and H. Tanaka, An Overview of the System Software of a Parallel Relational Database Machine: GRACE, Proc. of the 1986 VLDB Conference, Tokyo, August, 1986, 209–219.

    Google Scholar 

  7. P.B. Hawthorn and D.J. DeWitt, Performance Analysis of Alternative Database Machine Architectures, IEEE Trans. on Software Eng. SE-8(1), (1982), 61–75.

    Google Scholar 

  8. M. Kitsuregawa, H. Tanaka and T. Moto-oka, Application of Hash to Data Base Machine and Its Architecture, New Generation Computing 1(1), (1983), 63–74.

    Google Scholar 

  9. T.A. Marsland, T. Breitkreutz and S. Sutphen, NMP— A Network Multi-Processor, Tech. Rep. 88-22, Computing Science, University of Alberta, December, 1988.

    Google Scholar 

  10. L. Meng, Basic Issues in the Design and Implementation of a Tree-structured Database Machine (TDM), Ph.D. Dissertation (in Chinese), Computer Sci. Dept. Harbin Institute of Tech., May, 1987.

    Google Scholar 

  11. L. Meng and T.A. Marsland, Network Multiprocessor Database Machines, Proceedings of the 1989 CIPS Congress, Edmonton, May, 1989, 75–81.

    Google Scholar 

  12. L. Meng and T.A. Marsland, Analysis of Multiprocessor DBM Interconnections, (in preparation), June, 1990, 1–23.

    Google Scholar 

  13. J. Menon, A Study of Sort Algorithms for Multiprocessor Database Machines, Proc. of the 1986 VLDB Conference, Tokyo, August, 1986, 197–206.

    Google Scholar 

  14. M. Olafasson and T.A. Marsland, A UNIX Based Virtual Tree Machine, Proc. of the 1985 CIPS-ACI Congress, Montreal, June, 1985, 176–181.

    Google Scholar 

  15. D.A. Schneider and D.J. DeWitt, A Performance Evaluation of Four Parallel Join Algorithms in a Shared-Nothing Multiprocessor Environment, Proceedings of 1989 ACM SIGMOD, Portland, June, 1989, 110–121.

    Google Scholar 

  16. M. Stonebraker, The Case for Shared-Nothing, Database Engineering 9(1), (1986), 15–20.

    Google Scholar 

  17. S.Y.W. Su and C.K. Baru, Dynamically Partitionable Multicomputers with Switchable Memory, Journal of Parallel and Distributed Computing 1(2), (1984), 152–184.

    Google Scholar 

  18. P. Valduriez and G. Gardarin, Join and Semi-join Algorithms for a Multiprocessor Database Machine, ACM Trans. Database Systems 9(1), (1984), 133–161.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Science Department, University of Alberta, T6G 2H1, Edmonton, Canada

    T. A. Marsland & L. Meng

Authors
  1. T. A. Marsland
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L. Meng
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

S. G. Akl F. Fiala W. W. Koczkodaj

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Marsland, T.A., Meng, L. (1991). Control of bottlenecks in a network database machine. In: Akl, S.G., Fiala, F., Koczkodaj, W.W. (eds) Advances in Computing and Information — ICCI '90. ICCI 1990. Lecture Notes in Computer Science, vol 468. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53504-7_106

Download citation

  • DOI: https://doi.org/10.1007/3-540-53504-7_106

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53504-1

  • Online ISBN: 978-3-540-46677-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation