%0 Journal Article
%T Analysis of the Efficiency of Parallel Hash-Join Algorithms Based on Shared-Nothing<br>基于Shared-Nothing的并行Hash连接算法效率分析
%A LI Qing-hua
%A SUI Hai-yan
%A DENG Chong
%A <br>李庆华
%A 睢海燕
%A 邓冲
%J 软件学报
%D 2000
%I 
%X 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.
%K Query parallel processing
%K parallel join
%K query responding time
%K model of performance evaluation<br>查询并行处理
%K 并行连接
%K 查询响应时间
%K 性能评价模型.
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=A1761725AA1AD522&yid=9806D0D4EAA9BED3&vid=708DD6B15D2464E8&iid=38B194292C032A66&sid=B54EB62E9D3FF31E&eid=5A735990D5DE8BF4&journal_id=1000-9825&journal_name=软件学报&referenced_num=3&reference_num=10