TY - GEN
T1 - Efficient permutation-based range-join algorithms on N-dimensional meshes using data-shifting (preliminary version)
AU - Chen, Shao Dong
AU - Shen, Hong
AU - Topor, R.
N1 - Publisher Copyright:
© 2001 IEEE.
PY - 2001
Y1 - 2001
N2 - In this paper, we present two efficient parallel algorithms for computing a non-equijoin, range-join, of two relations an N-dimensional mesh-connected computers. The proposed algorithms uses the data-shifting approach to effectively permute every sorted subset of relation S to each processor in turn recursively in dimensions from low to high, where it is joined with the local subset of relation R.
AB - In this paper, we present two efficient parallel algorithms for computing a non-equijoin, range-join, of two relations an N-dimensional mesh-connected computers. The proposed algorithms uses the data-shifting approach to effectively permute every sorted subset of relation S to each processor in turn recursively in dimensions from low to high, where it is joined with the local subset of relation R.
UR - https://www.scopus.com/pages/publications/84981173529
U2 - 10.1109/IPDPS.2001.924951
DO - 10.1109/IPDPS.2001.924951
M3 - Conference contribution
AN - SCOPUS:84981173529
T3 - Proceedings - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001
BT - Proceedings - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001
Y2 - 23 April 2001 through 27 April 2001
ER -