Advertisement

VLSI mesh of trees for data base processing

  • M. A. Bonuccelli
  • E. Lodi
  • F. Luccio
  • P. Maestrini
  • L. Pagli
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 159)

Abstract

The VLSI chips introduced in preceding sections can be combined to construct a data base machine.

In order to execute all the operations required in a data base transaction or set of transactions a control processor to coordinate the MT devices is needed.

The control processor has to generate instructions for the MT's and to supervise their execution. Besides, it has to control the flow of data between SMT's, PMT's and Mass Storage. A straightforward architecture of such a system is illustrated in figure 2. We note that several PMT's are required both to enhance the parallelism of processing and to provide interconnection between SMT's and PMT's.

As a final note, we point out that the state of the art of VLSI technology imposes severe limitations on the size of MT's and, consequently on the size of data bases that can be stored or processed, in these elements. Although it can be expected that these limitations will eventually be overcome by the progress of technology, a relevant problem is how to extend the results given in this paper in order to deal with the case where relations exceed the size of SMT's and PMT's.

This result could be achieved by assuming that large relations be partitioned in several parts; high level operations be performed on the parts and the resulting relation be later recomposed from parts.

An efficient strategy to obtain this result, still sublinear in terms of time complexity, is currently under investigation.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    H.T.Kung and P.L.Lehman: "Systolic (VLSI) arrays for relational data base operations". Proc. ACM-SIG-MOD 1980 Int. Conf. on Management of Data, ACM, May 1980, pp. 105–116.Google Scholar
  2. [2]
    S.W.Song: "A highly concurrent tree machine for data base applications". Proc. IEEE 1980 Int. Conf. on Parallel Processing, pp. 259–260.Google Scholar
  3. [3]
    M.A.Bonuccelli, E.Lodi, F.Luccio, P.Maestrini and L.Pagli: "A VLSI tree machine for relational data bases", Università di Pisa, Istituto di Scienze dell'Informazione, Scientific Report S-82-12, June 1982.Google Scholar
  4. [4]
    P.L. Lehman: "A systolic (VLSI) array for processing simple relational queries". In H.T. Kung et al. Eds. VLSI systems and computations, Computer Science Press, Rockville, Md, 1981, pp. 285–295.Google Scholar
  5. [5]
    B.W.Arden and R.Ginosar: "A single-relation module for a data base machine". Proc. 8th Annual Symp. on Computer Architecture, May 1981.Google Scholar
  6. [6]
    T.Ottman, A.L.Rosenberg and L.J.Stockmeyer: "A dictionary machine (for VLSI)". IEEE Tr. on Computers, Sept. 1982, pp. 892–897.Google Scholar
  7. [7]
    F.P.Preparata and J.E.Vuillemin: "Area-time optimal VLSI networks for matrix multiplication", Proc. 14th Princeton Conf. on Information Science and Systems, 1980.Google Scholar
  8. [8]
    F.T.Leighton: "New lower bound techniques for VLSI", Proc. 22nd Annual Symposium on Foundations of Computer Science, 1981, pp. 1–12.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • M. A. Bonuccelli
    • 1
  • E. Lodi
    • 1
  • F. Luccio
    • 1
  • P. Maestrini
    • 1
  • L. Pagli
    • 1
  1. 1.Dipartimento di InformaticaUniversità di PisaPisaItaly

Personalised recommendations