Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
The research community has considered has-based parallel join algorithms the algorithms of choice for almost a decade. However, almost none of the commercial parallel database systems use hashing-based join algorithms, using instead nested-loops with index or sort-merge. While the research literature abounds with comparisons between the various hash-based and sort-merge join algorithms, to our knowledge there is no published comparison between the parallel hash-based algorithms and a parallel nested loops algorithm with index. In this paper we present a comparison of four variants of parallel index nested loops algorthims with the parallel hybrid hash algorithm. The conclusions of our experiments both with an analytic model and with an implementation in the Gamma parallel database system are that (1) overall, parallel hybrid hash is the method of choice, but (2) htere are caess where nested-loops with index wins big enough that systems could profit from implementing both algorithms. Furthermore, our experiments show that among the nested loop algorithms, one of them, subset nested loops with sorting, clearly dominates.