Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Database Machines

IWDM 1989: Database Machines pp 373–386Cite as

Analysis of some experimental results for the TDM

  • Project Retrospectives
  • Conference paper
  • First Online:

  • 139 Accesses

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

Abstract

So far, most results reported for multiprocessor database machines (DBMs) have been simulation results, and very few results are from a real database machine implementation. In this paper, we present some experimental results obtained from our real prototype: TDM (Tree-structured Database Machine). Analysis based on these results is given in detail. For three types of basic database operations: selection, sort, and join, we have obtained 9.96, 7.62, and 7.63 fold speed-ups respectively as the number of SPs (Slave Processors) increases from one to three. Analysis of an I/O throughput and a load balancing property is also presented. From these analysis, we believe that our TDM system is able to support a large database application with a better performance improvement.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C.K. Baru and O. Frieder, Implementing Relational Database Operations in a CUBECONNECTED Multiprocessor System, Proc. of the 1987 Intel. Conf. on Data Eng., Los Angeles, February, 1987, 36–43.

    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. C.K. Brau and S.Y.W. Su, The Architecture of SM3: a Dynamically Partitionable Multicomputer System, IEEE Trans. on Computers, C-35(9), (1986), 790–802.

    Google Scholar 

  4. D.J. DeWitt, DIRECT A Multiprocessor Organization for Supporting Relational Database Management Systems, IEEE Trans. on Computers, C-28(6), (1979), 395–406.

    Google Scholar 

  5. D.J. DeWitt and R.H. Gerber, Multiprocessor Hash-Based Join Algorithms, Proc. of the 1985 VLDB Conference, Stockholm, August, 1985, 151–164.

    Google Scholar 

  6. D.J. DeWitt, R.H. Gerber and G. Graefe, GAMMA A High Performance Dataflow Database Machine, Proc. of the 1986 VLDB Conference, Tokyo, August, 1986, 228–237.

    Google Scholar 

  7. 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 

  8. G. Gardarin and et al., Design of Multiprocessor Relational database System, Proc. of the 1983 IFIP Conference, Paris, 1983, 363–367.

    Google Scholar 

  9. J.R. Goodman and A.M. Despain, A Study of Interconnection of Multiple Processors in a Data Base Environment, Proc. of the 1980 International Conf. on parallel procesing, Harber Springs, August, 1980, 269–278.

    Google Scholar 

  10. X. He` and D. Hsiao, The Implementation of a Multibackend Database Systems (MBDS), in Advanced Database Machine Architecture, David Hsiao, ed., Prentice-Hall, 1983, 327–385.

    Google Scholar 

  11. T. Kakuta, N. Miyazaki, S. Shibayama and H. Yokota, The Design and Implementation of relational Database Machine: Delta, in Database Machine: Proc. of the 1985 Int. Workshop on DBMs, D.J. DeWitt and H. Boral, eds., March, 1985.

    Google Scholar 

  12. 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 

  13. L. Meng, Relational Data Base Processor: RDBP, Master Thesis (in chinese), Dept. of Computer Sci. HIT, June, 1984.

    Google Scholar 

  14. L. Meng, X. Xu, H. Chang, G. Chen, M. Hu and S. Li, Tree-structured Database Machine for Large Relational Database Systems, Journal of Computer Sci. & Tech., 2(4), (1987), 265–276.

    Google Scholar 

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

    Google Scholar 

  16. P. Neches, Hardware Support for Advanced Data Management Systems, Computer, 17(11), (1984), 29–40.

    Google Scholar 

  17. D.E. Shaw, Relational Query Processing on the NON-VON Supercomputer, in Query Processing in Database Systems, W. Kim, D. Triner and D. Batory, eds., Springer-Verlag, 1985, 248–258.

    Google Scholar 

  18. R.K. Shultz and R.J. Zingg, Response Time Analysis of Multiprocessor Computers for Database Support, ACM Transactions on Database Systems, 9(1), (1984), 100–132.

    Google Scholar 

  19. X. Xu', H. Chang and L. Meng, Design and Implementation of a Tree-structured Database Machine, Proc. of the 1987 IEEE Int. Conf. on Computer Applications, Beijing, June, 1987, 432–439.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Liming Meng

Authors
  1. Liming Meng
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Haran Boral Pascal Faudemay

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meng, L. (1989). Analysis of some experimental results for the TDM. 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_48

Download citation

  • DOI: https://doi.org/10.1007/3-540-51324-8_48

  • 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

Publish with us

Policies and ethics

Search

Navigation