New Generation Computing

, Volume 1, Issue 1, pp 63–74

Application of hash to data base machine and its architecture

  • Masaru Kitsuregawa
  • Hidehiko Tanaka
  • Tohru Moto-Oka
Regular Papers

DOI: 10.1007/BF03037022

Cite this article as:
Kitsuregawa, M., Tanaka, H. & Moto-Oka, T. NGCO (1983) 1: 63. doi:10.1007/BF03037022

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.

Copyright information

© Ohmsha, Ltd. and Springer 1983

Authors and Affiliations

  • Masaru Kitsuregawa
    • 1
  • Hidehiko Tanaka
    • 2
  • Tohru Moto-Oka
    • 2
  1. 1.Department of Electrical Engineering and Electronics, Institute of Industrial ScienceThe University of TokyoTokyo
  2. 2.Department of Electrical Engineering, Faculty of EngineeringThe University of TokyoTokyo

Personalised recommendations