摘要
叙述了在扩展BSP计算机上实现的shared_nothing 并行对象关系数据库（PORDB）的两阶段查询优化。它分为顺序优化阶段和并行化两个阶段。顺序优化阶段在预测并行通信代价的基础上，采用基于代价的顺序查询优化。并行化阶段为缩减搜索空间，先按照并行模式划分并行单元，再以并行单元为单位分配处理机。BSP模型可简化并行模式的实现和并行单元的划分。
Based on extended BSP computer, we implemented two-phrase query optimization of shared_nothing parallel object-relational database(PORDB). Two-phrase optimization includes sequential optimization and parallelization. Sequential phrase uses sequential optimization based on cost . In order to cut down the enormous search space, parallelization first divides query tree into parallel units according to parallel forms, then allocates processes to parallel units. The BSP model simplized the implemention of parallel forms and the division of parallel units.
出处
《计算机工程》
CAS
CSCD
北大核心
2000年第12期99-100,149,共3页
Computer Engineering
关键词
关系数据库
并行查询
优化
BSP模型
Parallel object-relational database；BSP computer；Two-phrase query optimization；Unit of parallelism；Form of parallelism
