Please use this identifier to cite or link to this item: https://doi.org/10.1109/69.390255
DC FieldValue
dc.titleOn sort-merge algorithm for band joins
dc.contributor.authorLu, Hongjun
dc.contributor.authorTan, Kian-Lee
dc.date.accessioned2014-10-27T06:03:22Z
dc.date.available2014-10-27T06:03:22Z
dc.date.issued1995-06
dc.identifier.citationLu, 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.issn10414347
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/99359
dc.description.abstractThis 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.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/69.390255
dc.sourceScopus
dc.typeArticle
dc.contributor.departmentINFORMATION SYSTEMS & COMPUTER SCIENCE
dc.description.doi10.1109/69.390255
dc.description.sourcetitleIEEE Transactions on Knowledge and Data Engineering
dc.description.volume7
dc.description.issue3
dc.description.page508-510
dc.description.codenITKEE
dc.identifier.isiutA1995RC86100012
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.