By Topic

Distributed join processing performance evaluation

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)
Perrizo, W. ; Dept. of Comput. Sci., North Dakota State Univ., Fargo, ND, USA ; Ram, P. ; Wenberg, D.

Efficient join acceleration methods that combine hybrid hashing, join indices and domain vectors with semi-join techniques to accelerate distributed joins are developed. An analytic performance model which allows for parallel execution of the methods at each join site is developed to compare the total task duration time of the methods. The methods are compared over a wide range of memory sizes, semijoin selectivities and network transmission speeds. The distributed join index method performs well if memory size is large and selectivity is low. The distributed hybrid hash method always has the advantage that it requires no residual data to be stored between runs, however performance is poor at low network transmission rates due to high pre-semijoin transmission requirements. The distributed domain vector hash method performs well in high selectivity conditions.<>

Published in:

System Sciences, 1994. Proceedings of the Twenty-Seventh Hawaii International Conference on  (Volume:2 )

Date of Conference:

4-7 Jan. 1994