Please use this identifier to cite or link to this item:
|Title:||On sort-merge algorithm for band joins||Authors:||Lu, Hongjun
|Issue Date:||Jun-1995||Citation:||Lu, Hongjun, Tan, Kian-Lee (1995-06). On sort-merge algorithm for band joins. IEEE Transactions on Knowledge and Data Engineering 7 (3) : 508-510. ScholarBank@NUS Repository. https://doi.org/10.1109/69.390255||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.||Source Title:||IEEE Transactions on Knowledge and Data Engineering||URI:||http://scholarbank.nus.edu.sg/handle/10635/99359||ISSN:||10414347||DOI:||10.1109/69.390255|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.