首页 | 本学科首页   官方微博 | 高级检索  
     

一种并行查询优化策略
引用本文:朱凤华,赖树华,陈昌生,孙永强.一种并行查询优化策略[J].计算机工程,2000,26(12):99-100,149.
作者姓名:朱凤华  赖树华  陈昌生  孙永强
作者单位:上海交通大学计算机科学与工程系,上海 200030
摘    要:叙述了在扩展BSP计算机上实现的shared_nothing并行对象关系数据库(PORDB)的两阶段查询优化。它分为顺序优化阶段和并行化两个阶段。顺序优化阶段在预测并行通信代价的基础上,采用基于代价的顺序查询优化。并行化阶段为缩减探索空间,先按照并行模式划分并行单元,再以并行单元为单位分配处理机。BSP模型可简化并行模式的实现和并行单元的划分。

关 键 词:关系数据库  并行查询  优化  BSP模型
文章编号:1000-3428(2000)12-0099-02

A Parallel Query Optimization Strategy
ZHU Fenghua,LAI Shuhua,CHEN Changsheng,SUN Yongqiang.A Parallel Query Optimization Strategy[J].Computer Engineering,2000,26(12):99-100,149.
Authors:ZHU Fenghua  LAI Shuhua  CHEN Changsheng  SUN Yongqiang
Abstract: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.
Keywords:
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号