Performance Enhancement Mechanism for Cellular Logic Data Base Machine

Masaru KITSUREGAWA; Mikio TAKAGI

Performance Enhancement Mechanism for Cellular Logic Data Base Machine

Masaru KITSUREGAWA, Mikio TAKAGI

Full Text Views

0

Share
Cite this

Summary :

Several types of machines have been proposed to improve the performance of data base management systems, especially the relational one. Among them, a cellular logic type data base machine such as RAP is characterized by its simple structure. Whereas this type of machine outperforms the conventional DBMS software by orders of magnitude for the relatively light load operations such as selection and update, it exhibits poor performance for the heavy load operations such as join and projection. This is because it adopts the nested loop algorithm which is very inefficient. Join has been so far the major performance bottle neck. In this paper we propose a performance enhancement mechanism for the cellular logic data base machine. A novel relational algebra processing algorithm based on the dynamic clustering feature of hash is presented. By introducing the hashing hardware, join operation is much accelerated in comparison with the conventional cellular logic data base machine. Its execution time is evaluated by simulation experiments. It has also been a major problem to handle large relations which cannot fit into the cell memories, where frequent paging degrades the performance severaly. A bucket based staging scheme has been proposed, through which the enhanced architecture can perform the join of large relations efficiently.

Publication: IEICE TRANSACTIONS on transactions Vol.E68-E No.12 pp.800-807

Publication Date: 1985/12/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Computers

Authors

Masaru KITSUREGAWA
Mikio TAKAGI

Keyword

Cite this

Copy

Masaru KITSUREGAWA, Mikio TAKAGI, "Performance Enhancement Mechanism for Cellular Logic Data Base Machine" in IEICE TRANSACTIONS on transactions, vol. E68-E, no. 12, pp. 800-807, December 1985, doi: .
Abstract: Several types of machines have been proposed to improve the performance of data base management systems, especially the relational one. Among them, a cellular logic type data base machine such as RAP is characterized by its simple structure. Whereas this type of machine outperforms the conventional DBMS software by orders of magnitude for the relatively light load operations such as selection and update, it exhibits poor performance for the heavy load operations such as join and projection. This is because it adopts the nested loop algorithm which is very inefficient. Join has been so far the major performance bottle neck. In this paper we propose a performance enhancement mechanism for the cellular logic data base machine. A novel relational algebra processing algorithm based on the dynamic clustering feature of hash is presented. By introducing the hashing hardware, join operation is much accelerated in comparison with the conventional cellular logic data base machine. Its execution time is evaluated by simulation experiments. It has also been a major problem to handle large relations which cannot fit into the cell memories, where frequent paging degrades the performance severaly. A bucket based staging scheme has been proposed, through which the enhanced architecture can perform the join of large relations efficiently.
URL: https://globals.ieice.org/en_transactions/transactions/10.1587/e68-e_12_800/_p

Copy

@ARTICLE{e68-e_12_800,
author={Masaru KITSUREGAWA, Mikio TAKAGI, },
journal={IEICE TRANSACTIONS on transactions},
title={Performance Enhancement Mechanism for Cellular Logic Data Base Machine},
year={1985},
volume={E68-E},
number={12},
pages={800-807},
abstract={Several types of machines have been proposed to improve the performance of data base management systems, especially the relational one. Among them, a cellular logic type data base machine such as RAP is characterized by its simple structure. Whereas this type of machine outperforms the conventional DBMS software by orders of magnitude for the relatively light load operations such as selection and update, it exhibits poor performance for the heavy load operations such as join and projection. This is because it adopts the nested loop algorithm which is very inefficient. Join has been so far the major performance bottle neck. In this paper we propose a performance enhancement mechanism for the cellular logic data base machine. A novel relational algebra processing algorithm based on the dynamic clustering feature of hash is presented. By introducing the hashing hardware, join operation is much accelerated in comparison with the conventional cellular logic data base machine. Its execution time is evaluated by simulation experiments. It has also been a major problem to handle large relations which cannot fit into the cell memories, where frequent paging degrades the performance severaly. A bucket based staging scheme has been proposed, through which the enhanced architecture can perform the join of large relations efficiently.},
keywords={},
doi={},
ISSN={},
month={December},}

Copy

TY - JOUR
TI - Performance Enhancement Mechanism for Cellular Logic Data Base Machine
T2 - IEICE TRANSACTIONS on transactions
SP - 800
EP - 807
AU - Masaru KITSUREGAWA
AU - Mikio TAKAGI
PY - 1985
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E68-E
IS - 12
JA - IEICE TRANSACTIONS on transactions
Y1 - December 1985
AB - Several types of machines have been proposed to improve the performance of data base management systems, especially the relational one. Among them, a cellular logic type data base machine such as RAP is characterized by its simple structure. Whereas this type of machine outperforms the conventional DBMS software by orders of magnitude for the relatively light load operations such as selection and update, it exhibits poor performance for the heavy load operations such as join and projection. This is because it adopts the nested loop algorithm which is very inefficient. Join has been so far the major performance bottle neck. In this paper we propose a performance enhancement mechanism for the cellular logic data base machine. A novel relational algebra processing algorithm based on the dynamic clustering feature of hash is presented. By introducing the hashing hardware, join operation is much accelerated in comparison with the conventional cellular logic data base machine. Its execution time is evaluated by simulation experiments. It has also been a major problem to handle large relations which cannot fit into the cell memories, where frequent paging degrades the performance severaly. A bucket based staging scheme has been proposed, through which the enhanced architecture can perform the join of large relations efficiently.
ER -