By Topic

Parallel join processing using nonclustered indexes for a shared memory multiprocessor

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)
E. Omiecinski ; Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA ; R. Shonkwiler

Examines the problem of efficient join processing on a shared memory multiprocessor, when the available access paths that are chosen (by the query optimizer) are nonclustered indexes on the joining attributes. Two algorithms based on simple heuristics and a third algorithm based on the Monte Carlo optimization technique called simulated annealing are given. Experiments are performed to compare the various algorithms with an algorithm that recently appeared in the literature

Published in:

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

Date of Conference:

9-13 Dec 1990