Referenced Items are not available for this document.
We present an adaptive version of the parallel distributive join (DJ) algorithm that we proposed in (Chung and Yang, 1996). The adaptive parallel DJ algorithm can handle the data skew in operand relations efficiently. We implemented the original and adaptive parallel DJ algorithms on a network of Alpha workstations using the Parallel Virtual Machine (PVM). We analyzed the performance of the algorithms, and compared it with that of the parallel Hybrid-Hash (HH) join algorithms. Our results show that the parallel DJ algorithms perform comparably with the parallel HH join algorithms over the entire range of the number of processors used and for different join selectivities. A significant advantage of the parallel DJ algorithms is that they can easily support non-equijoin operations
Published in:
Parallel and Distributed Systems, 2001. ICPADS 2001. Proceedings. Eighth International Conference on
Date of Conference: 2001
- Page(s):
- 15 - 22
- Meeting Date :
- 26 Jun 2001-29 Jun 2001
- ISSN :
- 1521-9097
- Print ISBN:
- 0-7695-1153-8
- INSPEC Accession Number:
- 7005920
- Conference Location :
- Kyongju City
- Digital Object Identifier :
- 10.1109/ICPADS.2001.934796
- Product Type:
- Conference Publications
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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
