.png){kind=icon}
返回
Managing the operator ordering problem in parallel databases
.png){kind=icon}
PRE
AI
DOI：10.1016/S0167-739X(99)00080-1.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-oriented Bushy Trees (LBT). Compared to the related approach of the General Bushy Trees (GBT) a significant complexity reduction of the operator ordering problem can be derived theoretically and demonstrated experimentally (e.g, compared with GBTs, LBTs authorize optimization time improvement that can reach up to 49%) without losing quality. Finally we demonstrate that existing commercial parallel query optimizers need little extension mod ifications in order to handle LBTs. (C) 2000 Elsevier Science B.V. All rights reserved.
Keyword:
parallel databases
parallel query optimization
Linear-oriented Bushy Trees
extending existing optimizers
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
F
IF:
6.1
论文数:
6.8K
被引数:
2.3W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏QUERY OPTIMIZATION AND EXECUTION PLAN GENERATION IN OBJECT-ORIENTED DATA MANAGEMENT-SYSTEMS面向对象数据管理系统中的查询优化和执行计划生成
PREAI
分享收藏
查看更多内容