For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Performance Enhancement Mechanism for Cellular Logic Data Base Machine
Masaru KITSUREGAWA Mikio TAKAGI
IEICE TRANSACTIONS (1976-1990)
Publication Date: 1985/12/25
Print ISSN: 0000-0000
Type of Manuscript: PAPER
Full Text: PDF(713.8KB)>>
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.