By Topic

Evaluation of linear join processing trees in shared-nothing database environment

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
$33 $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

2 Author(s)
L. Harada ; Fujitsu Labs. Ltd., Kawasaki, Japan ; N. Akaboshi

In this paper, aimed at understanding the effects of resource utilization in the performance of multi-way joins in shared-nothing database systems, we introduce a performance modeling for the left and right-deep linear join tree structures. The main purpose of the model is to get some insight into the behavior of the tree formats and their effects in the overall parallel processing. We present many performance results and show that the best multi-way join processing performance is achieved when the number of active operators can be adjusted in order to maximize the overlap of the disk and network transfers

Published in:

Computing and Information, 1993. Proceedings ICCI '93., Fifth International Conference on

Date of Conference:

27-29 May 1993