
Thorn, Naish, and Ramamohanarao
Introduction
The join operator is both a frequently used relational operator and an expensive
one in relational database systems. Several join algorithms have been discussed
in the recent literature, including Bratbergsengen [1984], DeWitt et al. [1984],
Jarke and Koch [1984], and Ullman [1985], for example, nested-loops, sort-
merge, and hash-join.
We propose another join algorithm, the super join algorithm. This algo-
rithm, based on multi-key hashing, partitions the join to enable efficient buffer
management. The superjoin algorithm is suitable for large relational databases
accessed from computers with larg ...