skip to main content
10.1145/1499310.1499389acmotherconferencesArticle/Chapter ViewAbstractPublication PagesafipsConference Proceedingsconference-collections
research-article
Free access

A database machine based on the data distribution approach

Published: 09 July 1984 Publication History

Abstract

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.

References

[1]
Babb, E. "Implementing a Relational Database by Means of Specialized Hardware." ACM Transactions on Database Systems, 4 (1979), pp. 1--29.
[2]
Dobosiewicz, W. "Sorting by Distributive Partitioning." Information Processing Letters 7 (1978), pp. 1--6.
[3]
Estein, R., and P. Hawthorn. "Design Decision for the Intelligent Database Machine." AFIPS, Proceedings of the National Computer Conference (Vol. 49), 1980, pp. 237--241.
[4]
Goodman, N., and O. Schmueli. "Transforming Cyclic Schemes into Trees." Proceedings of the ACM PODS, 1982, pp. 49--54.
[5]
B. Hsiao, D. K. "Data Base Computers." In Advances in Computers, Vol. 19. New York: Academic Press, 1980.
[6]
Kambayashi, Y., M. Yoshikawa, and S. Yajima. "Query Processing for Distributed Databases Using Generalized Semi-Joins." Proceedings of ACM SIGMOD, (1982), pp. 151--160.
[7]
Kim, W., D. J. Kuck, and D. Gajski. "A Bit Serial/Tuple-Parallel Relational Query Processor." Report, 1981.
[8]
Kung. H. T. "Why Systolic Architecture?" IEEE Transactions on Computers, 15, (1982), pp. 37--46.
[9]
Kung, H. T., and P. L. Lehman. "Systolic (VLSI) Arrays for Relational Database Operations." Proceedings of the ACM SIGMOD, (1980), pp. 105--116.
[10]
Lee, D. T., H. Chang, and C. K. Wong. "An On-Chip Compare/Steer Bubble Sorter." IEEE Transactions on Computers, C-30, (1981), pp. 398--405.
[11]
Lin, C. S., D. Smith, and J. Smith. "The Design of a Rotating Associative Memory for Relational Database Applications." ACM Transactions on Database Systems, 1 (1976), pp. 53--65.
[12]
Lipovski, G. J. "Architectural Features of CASSM: A Context Addressed Segment Sequential Memory." Proceedings of the Annual Symposium on Computer Architecture, (1978), pp. 31--38.
[13]
Maekawa, M. "Quick Parallel Join and Sorting Algorithms." Proceedings of the 14th IBM Japan Computer Science Symposium, 133, (1979), pp.
[14]
Maekawa, M. "Parallel Sort and Join for High Speed Database Machine Operations." Proceedings of the National Computer Conference, (Vol. 50), 1981, pp. 515--520.
[15]
Merrett, T. H. "Practical Hardware for Linear Execution of Relational Database Operations," Technical Report SOCS-81-30, School of Computer Science, McGill University, September 1981.
[16]
Merrett, T. H., Y. Kambayashi, and H. Yasuura. "Scheduling of Page-Fetches in Join Operations," Proceedings on Very Large Data Bases, (1981), pp. 488--498.
[17]
Orenstein, J. A., and T. H. Merrett. "Linear Sorting Methods Using Log n Processors," Technical Report SOCS-81-24, School of Computer Science, McGill University, October 1981.
[18]
Ozkarahan, E. A., S. A. Schuster, and K. C. Sevcik. "Performance Evaluation of a Relational Associative Processor." ACM Transactions on Database Systems, 2, (1977), pp. 175--195.
[19]
Tanaka, Y., Y. Nozaka, and A. Masuyama. "Pipeline Searching and Sorting Modules as Components of a Data Flow Database Computer," Proceedings of IFIP 80, (1980), pp.
[20]
Todd, S. "Algorithm and Hardware for a Merge Sort Using Multiple Processors," IBM Journal of Research and Development, 22 (1978).
[21]
Tong, F., and S. B. Yao. "Performance Analysis of Database Join Processors." AFIPS, Proceedings of the National Computer Conference. (Vol. 51), 1982, pp. 627--637.
[22]
Uemura, T., T. Yuba, A. Kokubu, R. Ooomote and Y. Sugawara. "Implementation of a Magnetic Bubble Database Machine." Proceedings of IFIP 80, (1980), pp. 433--438.
[23]
Wah, B. W., and S. B. Yao. "DIALOG---A Distributed Processor Organization for Database Machines." AFIPS Proceedings of the National Computer Conference (Vol. 49), 1980, pp. 243--253.
[24]
Winslow, L. E., and Y. C. Chow. "Parallel Sorting Machines: Their Speed and Efficiency," AFIPS, Proceedings of the National Computer Conference (Vol. 50), 1981, pp. 163--165.
[25]
Yasuura, H., N. Takagi, and S. Yajima. "The Parallel Enumeration Sorting Scheme for VLSI." IEEE Transactions on Computers, (1982).

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
AFIPS '84: Proceedings of the July 9-12, 1984, national computer conference and exposition
July 1984
746 pages
ISBN:0882830430
DOI:10.1145/1499310
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

  • AFIPS: American Federation of Information Processing Societies

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 July 1984

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 83
    Total Downloads
  • Downloads (Last 12 months)30
  • Downloads (Last 6 weeks)4
Reflects downloads up to 18 Jan 2025

Other Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media