基于丛生树的可调节的并行查询优化算法研究

Research on Adaptable Parallel Query Optimization Based on Bushy Tree Model

在分析现有的并行查询优化算法的基础上，提出了一种新的并行查询优化算法，该算法充分考虑并行计算机的物理限制，以丛生树为模型，利用大关系的数量对操作内的并行性、操作间的独立并行性以及操作间流水并行性进行调节。

This paper has presented a new parallel query optimization algorithm based on bushy tree model after analyzing the high performance computer system architecture. The algorithm can adapt to the intra operation parallelism, inter operation independent parallelism and inter operation pipeline parallelism within a query using the big relations, to produce effective query plans.