This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Heap-Filter Merge Join: A New Algorithm for Joining Medium-Size Inputs
September 1991 (vol. 17 no. 9)
pp. 979-982

A novel algorithm for relational equijoin is presented. The algorithm is a modification of merge join, but promises superior performance for medium-size inputs. In many cases it even compares favorably with both merge join and hybrid hash join, which is shown using analytic cost functions.

[1] K. Bratbergsengen, "Hashing methods and relational algebra operations," inProc. Conf. Very Large Data Bases(Singapore), Aug. 1984, pp. 323-333.
[2] D. J. DeWittet al., "Implementation techniques for main memory databases," inProc. ACM Sigmod(Boston, MA), June 18-21, 1984, pp. 1-8.
[3] D.J. Dewitt and R.H. Gerber, "Multiprocessor hash-based join algorithms," inProc. Conf. Very Large Data Bases(Stockholm, Sweden), Aug. 1985, pp. 151-164.
[4] S. Fushimi, M. Kitsuregawa, and H. Tanaka, "An overview of the system software of a parallel relational database machine GRACE," inProc. Conf. Very Large Data Bases(Kyoto, Japan), Aug. 1986, pp. 209-219.
[5] M. Kitsuregawa, H. Tanaka, and T. Motooka, "Application of Hash to Data Base Machine and its architecture,'New Generation Comput., vol. 1, p. 1, 1983.
[6] 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.
[7] D. E. Knuth,The Art of Computer Programming, Vol. 3, Reading, MA: Addison-Wesley, 1973.
[8] R. Kooi, "The optimization of queries in relational databases," Ph.D. dissert., Case Western Univ., Cleveland, OH, 1980.
[9] 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.
[10] 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.
[11] 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.

Index Terms:
heap filter merge join; medium-size inputs; novel algorithm; relational equijoin; merge join; medium-size inputs; hybrid hash join; analytic cost functions; database theory; relational databases
Citation:
G. Graefe, "Heap-Filter Merge Join: A New Algorithm for Joining Medium-Size Inputs," IEEE Transactions on Software Engineering, vol. 17, no. 9, pp. 979-982, Sept. 1991, doi:10.1109/32.92919
Usage of this product signifies your acceptance of the Terms of Use.