Abstract
In this paper we discuss the application of the dynamic clustering feature of hash to a relational data base machine. By partitioning the relation using hash, large load reductions in join and set operations are realized. Several machine architectures based on hash are presented. We propose a data base machineGRACE which adopts a novel relational algebraic processing algorithm based on hash and sort. Whereas conventional logic-per-track machines perform poorly in a join dominant environment,GRACE can execute join efficiently inO(N+M/K) time, whereN andM are the cardinalities of two relations andK the number of memory banks.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ozkarahan, E. A., Shuster, S. A. and Smith, K. C.: RAP-An Associative Processor for Data Base Management, Proc. AFIPS NCC,45 (1975) 379.
Leilich, H. O., Steige, G. and Zeidler, H. C. H.: A Search Processor forData Base Management Systems, Proc. Int. Conf. on VLDB (1978) 280.
Slotnick, D. L.: Logic per Track Devices, Advances in Computers,10 (Academic Press, New York, 1970) 291.
Ozkarahan, E. A., Shuster, S. A. and Smith, K. C.: Performance Evaluation of a Relational Associative Processor, ACM Trans. Database Syst.,2 (1977) 175.
DeWitt, D. J.: DIRECT-A Multiprocessor Organization for Supporting Relational Database Management Systems, IEEE Trans. Comput.,C-28 (1979) 395.
Menon, M. J. and Hsiao, D. K.: Design and Analysis of a Relational Join Operation for VLSI, Proc. Int. Conf. on VLDB (1981) 44.
Oliver, E. J. and Berra, P. B.: RELACS-A Relational Associative Computer System, Proc. of the Fifth Workshop on Computer Architecture for Non-Numeric Processing (1980) 106.
Kitsuregawa, M., Suzuki, S., Tanaka, H. and Moto-oka, T.: Relational Algebra Machine based on Hash and Sort,TGEC81-35 (IECE Japan, 1981).
Babb, E.: Implementing a Relational Database by Means of Specialized Hardware, ACM Trans. Database Syst.,4 (1979) 1.
Uemura, S., Yuba, T., Kokubu, A., Ooomote, R. and Sugawara, Y.: The Design and Implementation of a Magnetic Bubble Database Machine, Proc. of IFIP Congress (1980) 433.
Todd, S.: Algorithm and Hardware for a Merge Sort Using Multiple Processors, IBM J. Res. & Dev.,22 (1978) 509.
Kitsuregawa, M., Fushimi, S., Kuwabara, K., Tanaka, H. and Moto-oka, T.: An Organization of Pipeline Merge Sorter, Trans. IECE Japan,J66-D (1983) 332 [in Japanese].
Kohara, H., Takahashi, K., Suga, S. and Fujiwara, S.: Novel megabit bubble memory chip organization and its characteristics, Proc. of ICMB-4,D-3 (1980).
Author information
Authors and Affiliations
About this article
Cite this article
Kitsuregawa, M., Tanaka, H. & Moto-Oka, T. Application of hash to data base machine and its architecture. NGCO 1, 63–74 (1983). https://doi.org/10.1007/BF03037022
Issue Date:
DOI: https://doi.org/10.1007/BF03037022