Join processing in relational databases
ACM Computing Surveys (CSUR)
A Truncating Hash Algorithm for Processing Band-Join Queries
Proceedings of the Ninth International Conference on Data Engineering
An Evaluation of Non-Equijoin Algorithms
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Progressive merge join: a generic and non-blocking sort-based join algorithm
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Designing fast architecture-sensitive tree search on modern multicore/many-core processors
ACM Transactions on Database Systems (TODS)
On optimizing relational self-joins
Proceedings of the 15th International Conference on Extending Database Technology
The HELLS-join: a heterogeneous stream join for extremely large windows
Proceedings of the Ninth International Workshop on Data Management on New Hardware
| Hi-index | 0.00 |
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.