Efficient permutation-based range-join algorithms on N-dimensional meshes using data-shifting (preliminary version)

Shao Dong Chen; Hong Shen; R. Topor

doi:10.1109/IPDPS.2001.924951

Efficient permutation-based range-join algorithms on N-dimensional meshes using data-shifting (preliminary version)

Shao Dong Chen, Hong Shen, R. Topor

Griffith University Queensland

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

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.

Original language	English
Title of host publication	Proceedings - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001
Publisher	Institute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)	0769509908, 9780769509907
DOIs	https://doi.org/10.1109/IPDPS.2001.924951
Publication status	Published - 2001
Externally published	Yes
Event	15th International Parallel and Distributed Processing Symposium, IPDPS 2001 - San Francisco, United States Duration: 23 Apr 2001 → 27 Apr 2001

Publication series

Name	Proceedings - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001

Conference

Conference	15th International Parallel and Distributed Processing Symposium, IPDPS 2001
Country/Territory	United States
City	San Francisco
Period	23/04/01 → 27/04/01

Access to Document

10.1109/IPDPS.2001.924951

Cite this

Chen, S. D., Shen, H., & Topor, R. (2001). Efficient permutation-based range-join algorithms on N-dimensional meshes using data-shifting (preliminary version). In Proceedings - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001 Article 924951 (Proceedings - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/IPDPS.2001.924951

Chen, Shao Dong ; Shen, Hong ; Topor, R. / Efficient permutation-based range-join algorithms on N-dimensional meshes using data-shifting (preliminary version). Proceedings - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001. Institute of Electrical and Electronics Engineers Inc., 2001. (Proceedings - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001).

@inproceedings{22e65db3b52c4ccc9e28aa09cc6fe053,

title = "Efficient permutation-based range-join algorithms on N-dimensional meshes using data-shifting (preliminary version)",

abstract = "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.",

author = "Chen, {Shao Dong} and Hong Shen and R. Topor",

note = "Publisher Copyright: {\textcopyright} 2001 IEEE.; 15th International Parallel and Distributed Processing Symposium, IPDPS 2001 ; Conference date: 23-04-2001 Through 27-04-2001",

year = "2001",

doi = "10.1109/IPDPS.2001.924951",

language = "English",

series = "Proceedings - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

booktitle = "Proceedings - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001",

address = "United States",

}

Chen, SD, Shen, H & Topor, R 2001, Efficient permutation-based range-join algorithms on N-dimensional meshes using data-shifting (preliminary version). in Proceedings - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001., 924951, Proceedings - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001, Institute of Electrical and Electronics Engineers Inc., 15th International Parallel and Distributed Processing Symposium, IPDPS 2001, San Francisco, United States, 23/04/01. https://doi.org/10.1109/IPDPS.2001.924951

Efficient permutation-based range-join algorithms on N-dimensional meshes using data-shifting (preliminary version). / Chen, Shao Dong; Shen, Hong; Topor, R.
Proceedings - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001. Institute of Electrical and Electronics Engineers Inc., 2001. 924951 (Proceedings - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

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 - http://www.scopus.com/inward/record.url?scp=84981173529&partnerID=8YFLogxK

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 -

Chen SD, Shen H, Topor R. Efficient permutation-based range-join algorithms on N-dimensional meshes using data-shifting (preliminary version). In Proceedings - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001. Institute of Electrical and Electronics Engineers Inc. 2001. 924951. (Proceedings - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001). doi: 10.1109/IPDPS.2001.924951

Efficient permutation-based range-join algorithms on N-dimensional meshes using data-shifting (preliminary version)

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this