DocumentCode
793367
Title
On sort-merge algorithm for band joins
Author
Lu, Hongjun ; Tan, Kian-Lee
Author_Institution
Dept. of Inf. Syst. & Comput. Sci., Nat. Univ. of Singapore, Singapore
Volume
7
Issue
3
fYear
1995
fDate
6/1/1995 12:00:00 AM
Firstpage
508
Lastpage
510
Abstract
The article 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
Keywords
buffer storage; merging; query processing; resource allocation; sorting; band joins; buffer allocation; data skew; data skew handling; database query processing; estimation errors; inner relation; sort merge based band join algorithm; sort-merge algorithm; Computer science; Costs; Data engineering; Databases; Estimation error; Query processing; Robustness; Sorting; Writing;
fLanguage
English
Journal_Title
Knowledge and Data Engineering, IEEE Transactions on
Publisher
ieee
ISSN
1041-4347
Type
jour
DOI
10.1109/69.390255
Filename
390255
Link To Document