A database machine based on the data distribution approach

Various VLSI circuits, each of which realizes a specific database operation, have been studied; and a VLSI database machine can be created by a collection of these circuits. Such a method is called the function distribution approach. The problems of this approach are that (1) the data transmission cost is very high and (2) some circuits become very slow when the data size exceeds the maximum size handled by the circuits. Since database systems handle a large number of data, we need to develop another approach that costs less for data transmission and has expandability, Because most database operations can be divided into operations on subsets of data, this paper proposes the data distribution approach. In this approach a subset of data is stored in a functional storage circuit, and each circuit can realize most database operations. The whole system can be viewed as a file system having functions for database operations. Compared with conventional file systems, the system has the following advantages: (1) frequent rebalancing is not required, and (2) parallel processing of database operations is realized. Three methods to realize functional storage circuits are described. Selection is made by cost, performance, and available VLSI technology. An organization of such circuits with efficient database processing is discussed in detail; it will be realized by technology in the near future.

[1]  Toshitsugu Yuba,et al.  The Design and Implementaion of a Magnetic-Bubble Database Machine , 1980, IFIP Congress.

[2]  Paula B. Hawthorn,et al.  Design decisions for the intelligent database machine , 1980, AFIPS '80.

[3]  Yuzuru Tanaka,et al.  Pipeline Searching and Sorting Modules as Components of a Data Flow Database Computer , 1980, IFIP Congress.

[4]  Hiroto Yasuura,et al.  The Parallel Enumeration Sorting Scheme for VLSI , 1982, IEEE Transactions on Computers.

[5]  Masatoshi Yoshikawa,et al.  Query processing for distributed databases using generalized semi-joins , 1982, SIGMOD '82.

[6]  David K. Hsiao Data Base Computers , 1980, Adv. Comput..

[7]  Benjamin W. Wah,et al.  DIALOG: a distributed processor organization for database machine , 1980, AFIPS '80.

[8]  H. T. Kung Why systolic architectures? , 1982, Computer.

[9]  T. H. Merrett,et al.  Scheduling of Page-Fetches in Join Operations , 1981, VLDB.

[10]  Stephen Todd Algorithm and Hardware for a Merge Sort Using Multiple Processors , 1978, IBM J. Res. Dev..

[11]  Chyuan Shiun Lin,et al.  The design of a rotating associative memory for relational database applications , 1976, TODS.

[12]  Edward Babb,et al.  Implementing a relational database by means of specialzed hardware , 1979, TODS.

[13]  D. T. LEE,et al.  An On-Chip Compare/Steer Bubble Sorter , 1981, IEEE Transactions on Computers.

[14]  H. T. Kung,et al.  Systolic (VLSI) arrays for relational database operations , 1980, SIGMOD '80.

[15]  G. Jack Lipovski Architectural features of CASSM: A Context Addressed Segment Sequential Memory , 1978, ISCA '78.

[16]  Mamoru Maekawa,et al.  Parallel Join and Sorting Algorithms , 1982, Data Base Design Techniques II.

[17]  Wlodzimierz Dobosiewicz,et al.  Sorting by Distributive Partitioning , 1978, Inf. Process. Lett..

[18]  Mamoru Maekawa Parallel sort and join for high speed database machine operations , 1981, AFIPS '81.

[19]  Leon E. Winslow,et al.  Parallel sorting machines: their speed and efficiency , 1981, AFIPS '81.

[20]  T. H. Merrett Practical hardware for linear execution of relational database operations , 1983, SGMD.

[21]  S. Bing Yao,et al.  Performance analysis of database join processors , 1982, AFIPS '82.

[22]  Nathan Goodman,et al.  Transforming cyclic schemas into trees , 1982, PODS '82.