@inproceedings{5489e909544743febb251617d7fd0b74,
title = "A parallel sort-balance mutual range-join algorithm on hypercube computers",
abstract = "This paper presents an efficient parallel algorithm for computing the mutual range-join of N sets of numbers on shared-nothing hypercube computers. The algorithm iteratively joins each set to the mutual range-join of the preceding sets. Each join is performed on all processors of the hypercube in parallel. The algorithm uses a global sorting method to distribute the elements of the first set evenly across all processors in increasing order, a new data balancing technique to distribute the elements of subsequent sets to match the intermediate set at each processor and to compensate for join skew, and a new efficient local range-join procedure. We analyse the performance of this algorithm and demonstrate that it improves on the best previously published algorithm for this problem when the join selectivity factor is small. The method can also be applied to similar problems such as band-join and equi-join.",
author = "R. Wong and R. Topor and Hong Shen",
note = "Publisher Copyright: {\textcopyright} 1997 IEEE.; 3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997 ; Conference date: 10-12-1997 Through 12-12-1997",
year = "1997",
doi = "10.1109/ICAPP.1997.651538",
language = "English",
series = "1997 3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "731--743",
editor = "Wanlei Zhou and Andrzej Goscinski and Michael Hobbs",
booktitle = "1997 3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997",
address = "United States",
}