| 本文已被：浏览 3905次 下载 6008次 |
码上扫一扫！ |
|
|
| 基于Shared-Nothing的并行Hash连接算法效率分析 |
|
李庆华1,2, 睢海燕1,2, 邓冲1,2
|
|
1.国家高性能计算中心,武汉,430074;2.华中理工大学计算机学院,武汉,430074
|
|
| 摘要: |
| 该文研究了基于Shared-Nothing结构的几种常用并行连接算法,分析了影响查询响应时间的各种因素.在此基础上,以多种硬件成分作为参数建立一个代价分析模型.使用该模型计算并行Hash算法在每个处理机上的平均任务执行时间和总的查询响应时间,并比较了几种算法在不同硬件配置下的执行效率.所提出的模型和分析方法为评价和选取并行连接算法提供了一种可行的途径. |
| 关键词: 查询并行处理,并行连接,查询响应时间,性能评价模型. |
| DOI： |
| 分类号: |
| 基金项目:本文研究得到国家863高科技项目基金(No.863-306-ZD-01-7)资助. |
|
| Analysis of the Efficiency of Parallel Hash-Join Algorithms Based on Shared-Nothing |
|
LI Qing-hua,SUI Hai-yan,DENG Chong
|
| Abstract: |
| Based on the shared-nothing construction,the various factors which may affect the query responding time of parallel join algorithms are analyzed.A cost analysis model is proposed to calculate the average task execution time on each processor and the total query responding time.The execution efficiencies of different parallel Hash algorithms based on the variation of memory are compared.The presented model and the analysis method have provided a feasible way to evaluate and choose parallel join algorithms. |
| Key words: Query parallel processing,parallel join,query responding time,model of performance evaluation. |
