By Topic

Multi-weighted tree based query optimization method for parallel relational database systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jianzhong Li ; Dept. of Comput. Sci. & Eng., Harbin Inst. of Technol., China ; Zhipeng Cai ; Shuoying Chen

A multi-weighted tree based query optimization method for parallel relational databases is proposed. The method consists of a multi-weighted tree based parallel query plan model, a cost model for parallel query plans and a query optimizer. The parallel query plan model models three types of parallelism of query execution, processor and memory allocation to operations, memory allocation to buffers in pipelines and data redistribution among processors. The cost model takes the waiting time of operations in pipelining execution into consideration and is computable in a bottom-up fashion. The query optimizer addresses the query optimization problem in the context of Select-Project-Join queries. Heuristics for determining the processor allocation to operations and the memory allocation to operations and buffers in pipelines are derived and used in the query optimizer. In addition, the query optimizer considers multiple join algorithms, and can make an optimal choice of join algorithm for each join operation in a query

Published in:

Cooperative Database Systems for Advanced Applications, 2001. CODAS 2001. The Proceedings of the Third International Symposium on

Date of Conference:

2001