摘要
查询优化是并行数据库的核心技术。基于线性浓密树的查询优化方法是对基于浓密树(Bushy-Tree)查询优化方法的一种改进,这种优化方法大大地缩减了查询执行计划空间,确保了并行查询执行计划的优化性。
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.
出处
《湖南理工学院学报（自然科学版）》
CAS
2006年第1期20-23,共4页
Journal of Hunan Institute of Science and Technology(Natural Sciences)
关键词
并行数据库
线性浓密树
并行查询执行计划空间
并行数据库查询优化
parallel database
linear-bushy-tree
parallel query execution plan space
parallel database query optimization
