This Article 
 Bibliographic References 
 Add to: 
On Sort-Merge Algorithm for Band Joins
June 1995 (vol. 7 no. 3)
pp. 508-510

Abstract—This correspondence proposes two ways to improve the sort-merge based band join algorithm. The techniques proposed address issues that have not been previously discussed: to choose a right relation as the inner relation to achieve better performance and to optimally allocate and adjust buffer allocations to make the algorithms robust to data skew and estimation errors.

[1] D.J. DeWitt, J.F. Naughton, and D.A. Schneider, “An Evaluation of Non-Equijoin Algorithms,” Proc. 17th Conf. Very Large Databases (VLDB), pp. 443-452, Sept. 1991.
[2] P. Mishra and M.H. Eich, "Join Processing in Relational Databases," ACM Computing Surveys, vol. 24, no. 1, pp. 64-113, Mar. 1992.
[3] M. Negri and G. Pelagatti,“Join during merge: An improved sort-based algorithm,” Information Processing Letters, vol. 21, no. 1, pp. 11-16, July 1985.
[4] V. Soloviev,“A truncating hash algorithm for processing band-join queries,” Proc. Ninth Int’l Conf. Data Eng.,Vienna, Austria, pp. 419-427, Feb. 1993.
[5] G.K. Zipf,Human Behavior and the Principle of Least Effort,Addison Wesley, 1949.

Index Terms:
Band join algorithms, buffer allocation, database query processing, data skew handling.
Hongjun Lu, Kian-Lee Tan, "On Sort-Merge Algorithm for Band Joins," IEEE Transactions on Knowledge and Data Engineering, vol. 7, no. 3, pp. 508-510, June 1995, doi:10.1109/69.390255
Usage of this product signifies your acceptance of the Terms of Use.