Application of hash to data base machine and its architecture
Application of hash to data base machine and its architecture
复制标题
DOI：
10.1007/bf03037022
复制
发表时间：
1983-03
影响因子：
2.6
通讯作者：
M. Kitsuregawa;Hidehiko Tanaka;T. Moto-Oka
中科院分区：
文献类型：
--
作者：
M. Kitsuregawa;Hidehiko Tanaka;T. Moto-Oka
本文讨论了散列的动态聚类特性在关系数据库机中的应用。通过使用散列划分关系，实现了连接和集合操作的大负载减少。提出了几种基于哈希的机器结构。我们提出了一个数据库机GRACE，它采用了一种新的关系代数处理算法的基础上散列和排序。而传统的逻辑每轨道机器在连接占主导地位的环境中表现不佳，GRACE可以在O（N+M/K）的时间内有效地执行连接，其中N和M是两个关系的基数，K是内存库的数量。
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 machineGRACEwhich 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,GRACEcan execute join efficiently inO(N+M/K) time, whereNandMare the cardinalities of two relations andKthe number of memory banks.