Please use this identifier to cite or link to this item:
https://doi.org/10.1109/69.390255
DC Field | Value | |
---|---|---|
dc.title | On sort-merge algorithm for band joins | |
dc.contributor.author | Lu, Hongjun | |
dc.contributor.author | Tan, Kian-Lee | |
dc.date.accessioned | 2014-10-27T06:03:22Z | |
dc.date.available | 2014-10-27T06:03:22Z | |
dc.date.issued | 1995-06 | |
dc.identifier.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 | |
dc.identifier.issn | 10414347 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/99359 | |
dc.description.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. | |
dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/69.390255 | |
dc.source | Scopus | |
dc.type | Article | |
dc.contributor.department | INFORMATION SYSTEMS & COMPUTER SCIENCE | |
dc.description.doi | 10.1109/69.390255 | |
dc.description.sourcetitle | IEEE Transactions on Knowledge and Data Engineering | |
dc.description.volume | 7 | |
dc.description.issue | 3 | |
dc.description.page | 508-510 | |
dc.description.coden | ITKEE | |
dc.identifier.isiut | A1995RC86100012 | |
Appears in Collections: | Staff Publications |
Show simple 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.