Advertisement

A Network Algorithm for Relational Database Operations

  • Takanobu Baba
  • Hideki Saito
  • S. Bing Yao
Part of the The Kluwer International Series in Engineering and Computer Science book series (SECS, volume 43)

Abstract

This paper proposes a unified network algorithm for relational database operations. A popular shuffle-exchange network has been chosen to realize not only relational algebra operations but aggregation and set operations. Design issues for implementing the operations on a processor array are also presented. Microprogrammed processors were designed with two possible network organizations, called ‘multistage’ and ‘single-stage’, respectively. Software simulation was developed to evaluate the architecture.

Keywords

Execution Time Processing Element Network Organization Processor Array Database Operation 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    C.J. Date: An Introduction to Database Systems Volume II, Addison-Wesley, p.383(1983).Google Scholar
  2. [2]
    D.K. Hsiao: “Super database computers: Hardware and software solutions for efficient processing of very large databases,” Proc. IFIP Congress 86, pp.933–944(1986).Google Scholar
  3. [3]
    S. Sakai, M. Kitsuregawa, H. Tanaka, and T. Moto-oka: “Interconnection network for bucket distribution on relational algebra machine GRACE,” Trans. IECE Japan, Vol.J68-D, No.6, pp.1272–1279(1985).Google Scholar
  4. [4]
    Y. Tanaka: “MPDC: Massive parallel architecture for very large databases,” Proc. Int. Conf. on Fifth Generation Computer Systems, pp.113–137(1984).Google Scholar
  5. [5]
    T. Baba, S.B. Yao, and A.R. Hevner: “Design of a functionally distributed, multiprocessor database machine using data flow analysis,” IEEE Trans. on Computers, Vol.C-36, No.6, pp.650–666 (1987).CrossRefGoogle Scholar
  6. [6]
    Y. Kiyoki, and M. Amamiya: “An execution scheme for relational database operations with eager and lazy evaluations,” Trans. of Inf. Process. Soci. of Japan, Vol.26, No.4, pp.685–695(1985).Google Scholar
  7. [7]
    S. Yoshizumi, et al: “Vector-type high-speed database processor,” Proc. 32nd Annu. Conven. IPS Japan, pp.915–916 (1986).Google Scholar
  8. [8]
    H. Yasuura, N. Takagi, and S. Yajima: “The parallel enumeration sorting scheme for VLSI,” IEEE Trans. on Computers, Vol.C-31, No.12, pp.1191–1201(1982).CrossRefGoogle Scholar
  9. [9]
    C. Mead, and L. Conway: Introduction to VLSI Systems, Addison-Wesley (1980).Google Scholar
  10. [10]
    Y.C. Hong: “Efficient computing of relational algebraic primitives in a database machine architecture,” IEEE Trans. on Computers, Vol.C-34, No.7, pp.588–595(1985).CrossRefGoogle Scholar
  11. [11]
    W. Kim, D. Gajski, and D.J. Kuck: “A parallel pipelined relational query processor,” ACM Trans, on Database Systems, Vol.9, No.2, pp.214–242(1984).CrossRefGoogle Scholar
  12. [12]
    Y. Kambayashi: “A database machine based on the data distribution approach,” AFIPS Conf. Proc. NCC., Vol.53, pp.61 3–625(1984).Google Scholar
  13. [13]
    H. Saito, and T. Baba: “A processor array architecture for relational database operations,” Proc. 34th Annu. Conven. IPS Japan, pp.205–206(1987).Google Scholar
  14. [14]
    T. Baba: Microprogrammable Parallel Computer, The MIT Press, p.290(1987).Google Scholar
  15. [15]
    D. Bitton, D.J. DeWitt, D.K. Hsiao, and J. Menon: “A taxonomy of parallel sorting,” Computing Surveys, Vol.16, No.3, pp.287–318(1984).Google Scholar
  16. [16]
    S. Lakshmivarahan, S.K. Dhall, and L.L. Miller: “Parallel sorting algorithms,” Advances in Computers, Vol.23, pp.295–354(1984).MathSciNetCrossRefGoogle Scholar
  17. [17]
    K.E. Batcher: “Sorting networks and their applications,” AFIPS Conf. Proc., SJCC, pp.307–314(1968).Google Scholar
  18. [18]
    M. Maekawa: “Parallel sort and join for high speed database machine operations,” AFIPS Proc. NCC, Vol.50, pp.515–520 (1981).Google Scholar
  19. [19]
    T. Feng: “A survey of interconnection networks,” IEEE Computer, pp.12–27(1981).Google Scholar
  20. [20]
    T. Lang, and H.S. Stone: “A shuffle-exchange network with simplified control,” IEEE Trans. on Computers, Vol.C-25, No. 1, pp.55–65(1976).MathSciNetCrossRefGoogle Scholar
  21. [21]
    Texas Instruments Inc., LSI Logic Data Book (1986).Google Scholar
  22. [22]
    Digital Computer Ltd., U-station Users Manual.(1984).Google Scholar

Copyright information

© Kluwer Academic Publishers, Boston 1988

Authors and Affiliations

  • Takanobu Baba
    • 1
  • Hideki Saito
    • 1
  • S. Bing Yao
    • 2
  1. 1.Department of Information ScienceUtsunomiya UniversityUtsunomiyaJapan
  2. 2.Information Systems DepartmentUniversity of MarylandCollege ParkUSA

Personalised recommendations