Issue No. 03 - June (1995 vol. 7)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.390255
<p><it>Abstract</it>—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.</p>
Band join algorithms, buffer allocation, database query processing, data skew handling.
K. Tan and H. Lu, "On Sort-Merge Algorithm for Band Joins," in IEEE Transactions on Knowledge & Data Engineering, vol. 7, no. , pp. 508-510, 1995.