
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Shao Dong Chen, Hong Shen, Rodney Topor, "PermutationBased RangeJoin Algorithms on NDimensional Meshes," IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 4, pp. 413431, April, 2002.  
BibTex  x  
@article{ 10.1109/71.995821, author = {Shao Dong Chen and Hong Shen and Rodney Topor}, title = {PermutationBased RangeJoin Algorithms on NDimensional Meshes}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {13}, number = {4}, issn = {10459219}, year = {2002}, pages = {413431}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.995821}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  PermutationBased RangeJoin Algorithms on NDimensional Meshes IS  4 SN  10459219 SP413 EP431 EPD  413431 A1  Shao Dong Chen, A1  Hong Shen, A1  Rodney Topor, PY  2002 KW  analysis of algorithms KW  data permutation KW  N\hbox{}{\rm dimensional} meshes KW  relational databases KW  parallel processing KW  performance KW  rangejoin operations VL  13 JA  IEEE Transactions on Parallel and Distributed Systems ER   
In this paper, we present four efficient parallel algorithms for computing a nonequijoin, called
[1] S.G. Akl, The Design and Analysis of Parallel Algorithms. Orlando, Fl.: Academic Press, 1989.
[2] S.D. Chen, H. Shen, and R.W. Topor, “Efficient Parallel PermutationBased RangeJoin Algorithms on MeshConnected Computers,” Technical Report CIT9419, CIT, Griffith Univ., Australia, Aug. 1994.
[3] S.D. Chen, H. Shen, and R.W. Topor, “An Improved HashBased Join Algorithm in the Presence of Double Skew on a Hypercube Computer,” Proc. 17th Australian Computer Science Conf., Jan. 1994.
[4] S.D. Chen, H. Shen, and R.W. Topor, “PermutationBased Parallel RangeJoin Algorithm on NDimensional Torus Computers,” Information Processing Letters, vol. 52, no. 10, pp. 3538, Oct. 1994.
[5] S.D. Chen, H. Shen, and R.W. Topor, “Efficient Parallel PermutationBased RangeJoin Algorithms on MeshConnected Computers,” Proc. 1995 Asian Computing Science Conf., pp. 225238, Dec. 1995.
[6] D. DeWitt and J. Gray, “Parallel Database Systems: The Future of HighPerformance Database Systems,” Comm. ACM, Vol. 35, No. 6, June 1992, pp. 8598.
[7] D.J. DeWitt, J.F. Naughton, and D.A. Schneider, “An Evaluation of NonEquijoin Algorithms,” Proc. 17th Conf. Very Large Databases (VLDB), pp. 443452, Sept. 1991.
[8] Intel Corporation. Intel Corporation Literature. Nov. 1991.
[9] H. Jhang, “Performance Comparison of Join on Hypercube and Mesh” Proc. 1992 ACM Computer Science Conf., pp. 243250, 1992.
[10] M. Kitsuregawa and Y. Ogawa, “Bucket Spreading Parallel Hash: A New Robust, Parallel Hash Join Method for Data Skew in the Super Database Computer (SDC),” Proc. 16th Conf. Very Large Databases (VLDB), pp. 210221, 1990.
[11] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[12] D. Schneider and D. DeWitt, “A Performance Evaluation of Four Parallel Join Algorithms in a SharedNothing Multiprocessor Environment,” ACM SIGMOD Record, vol. 18, no. 2, pp. 110121, June 1989.
[13] H. Shen, “An Improved SelectionBased Parallel RangeJoin Algorithm in Hypercubes,” Proc. 20th EUROMICRO Conf., pp. 6572, Sept. 1994.
[14] H. Shen, “Efficient Parallel kSet Chain RangeJoin in Hypercubes.” Computer J., vol. 38, no. 3, pp. 217225, 1995.
[15] H. Shen, “An Efficient PermutationBased Parallel Algorithm for RangeJoin in Hypercubes,” Parallel Computing, vol. 21, pp. 303313, 1995.
[16] H. Shen, “Parallel kSet Mutual RangeJoin in Hypercubes,” Microprocessing and Microprogramming, vol. 41, no. 7, pp. 443448, 1995.
[17] M. Stonebraker, “The Case for Shared Nothing,” Database Eng., vol. 9, no. 1, pp. 49, 1986.
[18] J.D. Ullman, Principles of Database and KnowledgeBase Systems, vol. II: The New Tech nologies. New York: Computer Science Press, 1989.
[19] C.B. Walton, A.G. Dale, and R.M. Jenevein, “A Taxonomy and Performance Model of Data Skew Effects in Parallel Joins,” Proc. 17th Conf. Very Large Databases (VLDB), pp. 53748, Sept. 1991.