Tape libraries are suitable devices for storing such mass data.
Typically, during the execution of the join, the disks storing the dimension relations are not dedicated to the join. They are subject of reads and writes invoked by concurrently running applications. In many cases, it is desirable that the performance of these concurrent applications must not be degraded too much by the processing of the join. Based on the analytical model, we show the superiority of a disk scheduling strategy giving preference to the service of the concurrent disk load. Furthermore, we present a strategy for dynamically selecting the most beneficial join algorithm and its parameters at runtime.