| 基于线性浓密树的并行数据库查询优化算法 |
| |
| 引用本文： | 厉阳春. 基于线性浓密树的并行数据库查询优化算法[J]. 湖南理工学院学报：自然科学版, 2006, 19(1): 20-23 |
| |
| 作者姓名： | 厉阳春 |
| |
| 作者单位： | 咸宁学院计算机系 湖北咸宁437005 |
| |
| 摘 要： | 查询优化是并行数据库的核心技术。基于线性浓密树的查询优化方法是对基于浓密树(Bushy-Tree)查询优化方法的一种改进,这种优化方法大大地缩减了查询执行计划空间,确保了并行查询执行计划的优化性。
|
| 关 键 词： | 并行数据库 线性浓密树 并行查询执行计划空间 并行数据库查询优化 |
| 文章编号： | 1672-5298(2006)01-0020-04 |
| 收稿时间： | 2005-10-28 |
| 修稿时间： | 2005-10-28 |
Linear-bushy-tree based query optimization algorithms for parallel database systems |
| |
| LI Yang-chun. Linear-bushy-tree based query optimization algorithms for parallel database systems[J]. Journal of Hunan Institute of Science and Technology, 2006, 19(1): 20-23 |
| |
| Authors: | LI Yang-chun |
| |
| Affiliation: | Department of Computer, Xianning college ,Xianning 437005, China |
| |
| Abstract: | Query optimization is the critical technique of parallel database systems. A Linear-Bushy-Tree based query optimization method for parallel database systems is presented in the paper. This method improves the old query optimization method based on Bushy-Tree. This method cuts down query plan search space greatly, thus ensures the quality of parallel query execution plans. |
| |
| Keywords: | parallel database linear-bushy-tree parallel query execution plan space parallel database query optimization |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
