摘要
并行查询执行计划的搜索空间里指数级增长，如何高效地裁剪搜索空间是并行查询优化的关键所在。ＰＢＡＳＥ／２以流机制为基础，采用基于代价估算和启发式规则的改良的两阶段优化技术，有效地解决了这一问题。
The search space of parallel query execution plan is exponential complexity. How to prune the search space efficiently is the key problem of parallel query optimization. PBASE/2 is based on stream mechanism. It uses an improved two-phase approach based on cost estimation and heuristics to solve this problem effectively.
出处
《计算机工程》
EI
CAS
CSCD
北大核心
2000年第7期11-12,187,共3页
Computer Engineering
基金
国家863高技术计划
国家自然科学基金
