By Topic

Parallel join algorithms for nested relations on shared-memory multiprocessors

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

3 Author(s)
V. Deshpande ; Dept. of Comput. Sci., Waterloo Univ., Ont., Canada ; P. -A. Larson ; T. P. Martin

The authors examine the problem of performing a join involving nested relations in a parallel shared-everything environment. They show the difference between joining flat relations and joining nested relations, and then develop hash-based parallel join algorithms. Both IO and CPU parallelism are addressed. Preliminary experimental results are presented

Published in:

Parallel and Distributed Processing, 1990. Proceedings of the Second IEEE Symposium on

Date of Conference:

9-13 Dec 1990