By Topic

An adaptive hash join algorithm on a network of workstations

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)
K. Imasaki ; Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont., Canada ; S. Dandamudi

Due to advances in computer technology, many organizations have a large number of workstation-class machines connected by LAN. Such a network of workstations (NOW) can be used for parallel processing, including database query processing. This paper proposes a new load sharing algorithm for hash join processing on NOWs. This new algorithm combines a chunking method with hash join to manage dynamic changes that occur in NOW environments. The algorithm is compared with two other algorithms: an adaptive nested-loop join and adaptive GRACE hash join. These three algorithms were evaluated on a Pentium-based heterogeneous NOW system with skewed data and various non-query background loads. The results show that the new algorithm is the best among the three in most of the cases and should be used for single join processing on NOWs.

Published in:

Parallel and Distributed Processing Symposium., Proceedings International, IPDPS 2002, Abstracts and CD-ROM

Date of Conference:

15-19 April 2001