Proceedings 2002 International Symposium on Parallel Architectures, Algorithms, and Networks
Download PDF

Abstract

The use of page-level join index in parallel join optimization requires a proper sequence for accessing data pages in the form of join components. The current approach to this method involves a strategy that retrieves first those components with a high number of page joins so as to keep all processors busy early in the join execution. However, problems regarding conflicts with other valid reading strategies and the choice of an appropriate component whenever several of them satisfy the selection criterion have not been specifically addressed. We call such conflicts as the Join Component Selection (JCS) problem. To resolve this problem, this paper proposes appropriate component retrieving strategies that will further optimize the parallel join execution. Simulation results demonstrate an improvement over the existing one.
Like what you’re reading?
Already a member?
Get this article FREE with a new membership!