Cart (Loading....) | Create Account
Close category search window
 

Parallel join algorithms based on parallel B+-trees

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)
Jianzhong Li ; Dept. of Comput. Sci. & Eng., Harbin Inst. of Technol., China ; Wenjun Sun ; Yingshu Li

Within the last several years, a number of parallel algorithms for the join operation have been proposed. However, almost all of these algorithms do not take advantage of the underlying parallel storage structures or data declustering methods of the operand relations. The paper introduces the concept of parallel storage structure or declustering aware parallel join algorithm. Two classes of parallel join algorithms, which take advantage of the underlying parallel B+-tree index, are proposed and analyzed. One class is based on the range-partition strategy. The other is based on the hash-partition strategy. The parallel execution times of the algorithms are linearly proportional to max{N/P, M/P}, where N and M are the numbers of tuples of the operand relations and P is the number of processing nodes. The proposed parallel join algorithms are compared with well known parallel join algorithms in practice. Theoretical and experimental results show that the proposed algorithms are more efficient than others in case of at least one operand relation having a parallel B+-tree index on the join attributes

Published in:

Cooperative Database Systems for Advanced Applications, 2001. CODAS 2001. The Proceedings of the Third International Symposium on

Date of Conference:

2001

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.