This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Adaptive-Hash Join Algorithm for a Hypercube Multicomputer
May 1992 (vol. 3 no. 3)
pp. 334-349
ASCII Text
x 
 
E. Omiecinski, E.T. Lin, "The Adaptive-Hash Join Algorithm for a Hypercube Multicomputer," IEEE Transactions on Parallel and Distributed Systems, vol. 3, no. 3, pp. 334-349, May, 1992.
 
 
BibTex
x
 
@article{ 10.1109/71.139207,
author = {E. Omiecinski and E.T. Lin},
title = {The Adaptive-Hash Join Algorithm for a Hypercube Multicomputer},
journal ={IEEE Transactions on Parallel and Distributed Systems},
volume = {3},
number = {3},
issn = {1045-9219},
year = {1992},
pages = {334-349},
doi = {http://doi.ieeecomputersociety.org/10.1109/71.139207},
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 - The Adaptive-Hash Join Algorithm for a Hypercube Multicomputer
IS - 3
SN - 1045-9219
SP334
EP349
EPD - 334-349
A1 - E. Omiecinski,
A1 - E.T. Lin,
PY - 1992
KW - Index Termshypercube multicomputer; adaptive-hash join algorithm; nested-loop; hybrid-hash; file organisation; hypercube networks; parallel algorithms
VL - 3
JA - IEEE Transactions on Parallel and Distributed Systems
ER -
 
The cube adaptive-hash join algorithm, which combines the merits of nested-loop and hybrid-hash, is presented. The performance of these algorithms is compared through analytical cost modeling. The nonuniform data value distribution of the inner relation is shown to have a greater impact than that of the outer relation. The cube adaptive-hash algorithm outperforms the cube hybrid-hash algorithm when bucket overflow occurs. In the worst case, this algorithm converges to the cube nested-loop-hash algorithm. When there is no hash table overflow, the cube adaptive-hash algorithm converges to the cube hybrid-hash algorithm. Since the cube adaptive-hash algorithm adapts itself depending on the characteristics of the relations, it is relatively immune to the data distribution.

[1] C. K. Baru and O. Frieder, "Implementing relational database operations in a cube-connected multicomputer," inProc. IEEE 3rd Int. Conf. Data Eng., Feb. 1987, pp. 36-43.
[2] C. K. Baru, O. Frieder, D. Kandlur, and M. Segal, "Join on a cube: Analysis, simulation, and implementation," inDatabase Machines and Knowledge Base Machines, M. Kitsuregawa and H. Tanaka, Eds. Boston, MA: Kluwer Academic, 1988, pp. 61-74.
[3] D. Bittonet al., "Parallel algorithms for the execution of relational database operation,"ACM Trans. Database Syst., vol. 8, no. 3, pp. 324-353, Sept. 1983.
[4] D. J. DeWitt and R. Gerber, "Multiprocessor hash-based join algorithms," inProc. Eleventh Int. Conf. Very Large Data Bases, 1985, pp. 151-164.
[5] D. Dewitt, R. H. Gerber, G. Graefe, M. L. Heytens, K. B. Kumar, and M. Muralikrishna, "GAMMA--A high performance dataflow database machine," inProc. 12th Int. Conf. VLDB, Kyoto, Japan, Aug. 1986, pp. 228-237.
[6] D. J. DeWittet al., "Implementation techniques for main memory databases," inProc. ACM Sigmod(Boston, MA), June 18-21, 1984, pp. 1-8.
[7] O. Frieder, "Database processing on a cube-connected multicomputer," Dep. Elec. Eng. Comput. Sci., Univ. of Michigan, 1987.
[8] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
[9] J. Hayes, T. Mudge, Q. Stout, S. Colley, and J. Palmer, "Architecture of a hypercube supercomputer," inProc. IEEE Conf. Parallel Processing, 1986, pp. 653-660.
[10] iPSC/2 and iPSC/860 User's Guide, Intel Corp., June 1990.
[11] M. Kitsuregawa, M. Nakano, and M. Takagi, "Query execution for large relations on functional disk system," inProc. IEEE Conf. Data Eng.(Los Angeles, CA), Feb. 1989, p. 159.
[12] M. Kitsuregawa, M. Nakayama, and M. Takagi, "The effect of bucket size tuning in dynamic hybrid GRACE hash join method," inProc. 15th Int. Conf. Very Large Data Bases, 1989, pp. 257-266.
[13] M. Kitsuregawa, H. Tanaka, and T. Moto-Oka, "Application of hash to database machine and its architecture,"New Generation Comput., vol. 1, no. 1, pp. 63-74, 1983.
[14] M. Kitsuregawa, H. Tanaka, and T. Moto-Oka, "Architecture and performance of relational algebra machine GRACE," inInt. Conf. Parallel Processing Proc., Aug. 1984, pp. 241-250.
[15] M. S. Lakshmi and P. S. Yu, "Performance of relational join operations on parallel architectures," Tech. Rep. RC 13370, IBM Research Division, Dec. 1987.
[16] B. Charron-Bost, "Combinatorics and Geometry of Consistent Cuts: Application to Concurrency Theory," inDistributed Algorithms, J.-C. Bermond and M. Raynal. eds.,Lecture Notes in Computer Science, Vol. 392, Springer-Verlag, Berlin, 1989.
[17] S. Lakshmi and P. S. Yu, "Limiting factors of join performance on parallel processors,"Proc. 5th Int. Conf. Data Eng., Feb. 1989, pp. 488-496.
[18] J. Liebeherr, E. Omiecinski, and I. Akyildiz, "Index partitioning schemes for a locally distributed database system," Tech. Rep. GIT-ICS-89/40, Georgia Tech, Nov. 1989.
[19] M. Nakayama, M. Kitsuregawa, and M. Takagi, "Hash-partitioned join method using dynamic destaging strategy," inProc. Conf. Very Large Databases(Los Angeles, CA), Aug. 1988, pp. 468-478.
[20] E. Omiecinski and E. T. Lin, "Hash-based and index-based join algorithms for cube and ring connected multicomputers,"IEEE Trans. Knowledge Data Eng., vol. 1, pp. 329-343, Sept. 1989.
[21] E. Omiecinski and E. Tien, "A hash-based join algorithm for a cube-connected parallel computer,"Info. Proc. Lett., vol. 30, no. 5, pp. 269-275, Mar. 1989.
[22] J. F. Palmer, "A VLSI parallel supercomputer,"SIAM Hypercube Multiprocessors, pp. 19-26, 1986.
[23] G. Z. Qadah, "The equi-join operation on a multiprocessor database machine: Algorithms and the evaluation of their performance," inDatabase Machines: 4th Int. Workshop, D. J. DeWitt and H. Boral, Eds., Springer-Verlag, Mar. 1985, pp. 35-67.
[24] J. P. Richardson, H. Lu, and K. Mikkilineni, "Design and evaluation of parallel pipelined join algorithms," inProc. 1987 ACM SIGMOD Int. Conf. Management of Data, May 1987, pp. 399-409.
[25] D. Schneider and D. Dewitt, "A performance evaluation of four parallel join algorithms in a shared-nothing multiprocessor environment," inProc. ACM SIGMOD Conf.(Portland, OR), May-June 1989, p. 110.
[26] L. D. Shapiro, "Join processing in database systems with large main memories,"ACM Trans. Database Syst., vol. 11, no. 3, pp. 239-264, Sept. 1986.
[27] D. Shaw, "Relational query processing on the NON-VON supercomputer," inQuery Processing in Database Systems, W. Kim, D. Reiner, and D. Batory, Eds., 1985, pp. 240-258.
[28] R. Shultz and L. Miller, "Tree structured multiple processor join methods," inProc. IEEE Data Eng. Conf., 1987, pp. 190-199.
[29] S. Y. W. Su and C. K. Baru, "Dynamically partitionable multicomputers with switchable memory,"J. Parallel Distributed Comput., vol. 1, pp. 152-184, Nov. 1984.
[30] J. Tuazon, J. Peterson, M. Pniel, and D. Leberman, "Caltech/JPL Mark II hypercube concurrent processor," inProc. IEEE Conf. Parallel Processing, 1985, pp. 666-673.
[31] P. Valduriez and G. Gardarin, "Join and semi-join algorithms for a multiprocessor database machine,"ACM Trans. Database Syst., vol. 9, no. 1, pp. 133-161, 1984.

Index Terms:
Index Termshypercube multicomputer; adaptive-hash join algorithm; nested-loop; hybrid-hash; file organisation; hypercube networks; parallel algorithms
Citation:
E. Omiecinski, E.T. Lin, "The Adaptive-Hash Join Algorithm for a Hypercube Multicomputer," IEEE Transactions on Parallel and Distributed Systems, vol. 3, no. 3, pp. 334-349, May 1992, doi:10.1109/71.139207
Usage of this product signifies your acceptance of the Terms of Use.