期刊文献+

Optimization of Multi-Join Queries in Shared-Nothing Systems

Optimization of Multi-Join Queries in Shared-Nothing Systems
原文传递
导出
摘要 This paper proposes a semi-greedy framework for optimizing multi-joinqueries in shared-nothing systems. The plan generated by the framework com-prises several pipelines, each performing several joins. The framework deter-mines the 'optimal' number of joins to be performed in each pipeline. Thedecisions are made based on the cost estimation of the entire processing plan.Two ekisting optimization algorithms are extended under the framework. Ananalytical model is presented and used to compare the quality of plans producedby each optimization algorithm. Our study shows that the new algorithms out-perform their counterparts that are not extended. This paper proposes a semi-greedy framework for optimizing multi-joinqueries in shared-nothing systems. The plan generated by the framework com-prises several pipelines, each performing several joins. The framework deter-mines the 'optimal' number of joins to be performed in each pipeline. Thedecisions are made based on the cost estimation of the entire processing plan.Two ekisting optimization algorithms are extended under the framework. Ananalytical model is presented and used to compare the quality of plans producedby each optimization algorithm. Our study shows that the new algorithms out-perform their counterparts that are not extended.
出处 《Journal of Computer Science & Technology》 SCIE EI CSCD 1995年第2期149-162,共14页 计算机科学技术学报(英文版)
关键词 Multi-join optimization shared-nothing systems pipelining hash join segmented right-deep tree Multi-join optimization, shared-nothing systems, pipelining,hash join, segmented right-deep tree
  • 相关文献

参考文献4

  • 1Hua K A,2nd PDIS Conf,1993年
  • 2Chen M S,18th VLDB Conf,1992年
  • 3Hua K A,17th VLDB Conf,1991年
  • 4Tan Kianlee,Int J Computer Systems and Engineering

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部