文献类型：期刊文献

英文题名：Large query optimization based on lessening complexity

作者：Zhang, Huawei[1]; Zhang, Wen[2]

第一作者：张华伟

通讯作者：Zhang, H.|[1048412518b767f]张华;

机构：[1] College of Computer and Information Engineering, Henan University of Economics and Law, Zhengzhou450003, China; [2] College of Information Engineering, Zhongzhou University, Zhengzhou 450044, China

第一机构：河南财经政法大学计算机与信息工程学院

通讯机构：[1]College of Computer and Information Engineering, Henan University of Economics and Law, Zhengzhou450003, China|[1048412]河南财经政法大学计算机与信息工程学院;[10484]河南财经政法大学;

年份：2012

卷号：4

期号：6

起止页码：157-164

外文期刊名：International Journal of Advancements in Computing Technology

收录：EI(收录号：20121714959477);Scopus(收录号：2-s2.0-84859867539)

语种：英文

外文关键词：Graph algorithms - Multiprocessing systems - Query processing

摘要：In order to improve the query optimizer's processing capacity and reduce the search space for dynamic programming algorithm, this paper exploits the estimated analogical sub-queries to avoid constructing vast query plans and proposes an optimization framework for parallelizing query by multi-threaded processing based on Chip Multi-Processor (CMP) that strives for maximum resource utilization. A set of algorithms for constructing logic expression of query plan by traversing query graph and realizing the collection of analogical sub-queries are proposed. Our theoretical results and empirical evaluation show algorithm impressive gains in the performance in terms of running time.