首页 | 本学科首页   官方微博 | 高级检索  
     

基于Shared-Nothing的并行Hash连接算法效率分析
引用本文:李庆华,睢海燕,邓冲.基于Shared-Nothing的并行Hash连接算法效率分析[J].软件学报,2000,11(3):386-392.
作者姓名:李庆华  睢海燕  邓冲
作者单位:国家高性能计算中心,武汉,430074;华中理工大学计算机学院,武汉,430074
基金项目:本文研究得到国家863高科技项目基金(No.863-306-ZD-01-7)资助.
摘    要:该文研究了基于Shared-Nothing结构的几种常用并行连接算法,分析了影响查询响应时间的各种因素.在此基础上,以多种硬件成分作为参数建立一个代价分析模型.使用该模型计算并行Hash算法在每个处理机上的平均任务执行时间和总的查询响应时间,并比较了几种算法在不同硬件配置下的执行效率.所提出的模型和分析方法为评价和选取并行连接算法提供了一种可行的途径.

关 键 词:查询并行处理  并行连接  查询响应时间  性能评价模型.
收稿时间:1998/10/8 0:00:00
修稿时间:4/2/1999 12:00:00 AM

Analysis of the Efficiency of Parallel Hash-Join Algorithms Based on Shared-Nothing
LI Qing-hu,SUI Hai-yan and DENG Chong.Analysis of the Efficiency of Parallel Hash-Join Algorithms Based on Shared-Nothing[J].Journal of Software,2000,11(3):386-392.
Authors:LI Qing-hu  SUI Hai-yan and DENG Chong
Affiliation:LI Qing hua SUI Hai yan DENG Chong(National High Performance Computing Center Wuhan 430074) (School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074)
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.
Keywords:Query parallel processing  parallel join  query responding time  model of performance evaluation  
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《软件学报》浏览原始摘要信息
点击此处可从《软件学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号