| 引用本文: | 昌月楼.基于丛生树的多流水线并行Hash连接的处理机分配算法.[J].国防科技大学学报,1998,20(5):106-108.[点击复制] |
| Chang Yuelou.An Algorithm to Allocate Processors among Bush Tree to Get Multiple Pipelined Parallel Execution on Hash Join[J].Journal of National University of Defense Technology,1998,20(5):106-108[点击复制] |
|
| |
|
|
| 本文已被：浏览 6325次 下载 5996次 |
| 基于丛生树的多流水线并行Hash连接的处理机分配算法 |
| 昌月楼 |
|
(国防科技大学 计算机系 湖南 长沙 410073)
|
| 摘要: |
| 本文介绍了并行数据库中实现多流水线Hash连接的处理机分配算法, 该算法对于执行Hash连接的丛生查询树可同时实现流水线内并行(Intrapipeline Parallel) 和多流水线间的并行(Intrapipeline Parallel) |
| 关键词: 并行数据库, Hash连接, 流水线, 丛生树 |
| DOI： |
| 投稿日期：1998-03-19 |
| 基金项目:国家863计划项目 |
|
| An Algorithm to Allocate Processors among Bush Tree to Get Multiple Pipelined Parallel Execution on Hash Join |
| Chang Yuelou |
|
(Department of Comoputer Science, NUDT Changsha, 410073)
|
| Abstract: |
| An algorithm on how to allocate processors for bush query tree to get multiple pipelined parallel execution with hash join is presented in this paper. An example is given for further description. |
| Keywords: parallel data base, hash join, pipeline, bush tree |
|
|
