https://scholars.lib.ntu.edu.tw/handle/123456789/154859
標題: | Parallel Execution of Hash Joins in Parallel Databases | 作者: | Hsiao, Hui-I MING-SYAN CHEN Yu, P.S. |
關鍵字: | Bushy trees; Hash filters; Hash joins; Pipelining | 公開日期: | 1997 | 卷: | 8 | 期: | 8 | 起(迄)頁: | 872-883 | 來源出版物: | IEEE Transactions on Parallel and Distributed Systems | 摘要: | In this paper, we explore two important issues, processor allocation and the use of hash filters, to improve the parallel execution of hash joins. To exploit the opportunity of pipelining for hash join execution, a scheme to transform a bushy execution tree to an allocation tree is first devised. In an allocation tree, each node denotes a pipeline. Then, using the concept of synchronous execution time, processors are allocated to the nodes in the allocation tree in such a way that inner relations in a pipeline can be made available at approximately the same time. Also, the approach of hash filtering is investigated to further improve the parallel execution of hash joins. Extensive performance studies are conducted via simulation to demonstrate the importance of processor allocation and to evaluate various schemes using hash filters. It is experimentally shown that processor allocation is, in general ,the dominant factor to performance, and the effect of hash filtering becomes more prominent as the number of relations in a query increases. © 1997 IEEE. |
URI: | http://ntur.lib.ntu.edu.tw//handle/246246/141939 http://ntur.lib.ntu.edu.tw/bitstream/246246/141939/1/12.pdf https://www.scopus.com/inward/record.uri?eid=2-s2.0-0031210040&doi=10.1109%2f71.605772&partnerID=40&md5=91b850698f604ade35dc929f10923a46 |
ISSN: | 10459219 | DOI: | 10.1109/71.605772 | SDG/關鍵字: | Digital filters; Distributed database systems; Mathematical transformations; Pipeline processing systems; Storage allocation (computer); Trees (mathematics); Bushy trees; Hash filters; Hash joins; Parallel databases; Parallel processing systems |
顯示於: | 電機工程學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。