We developed a concise but comprehensive analytical model for the well-known sort merge Join algorithm on cost effective cluster architectures.
We try to concentrate on a limited number of characteristic parameters to keep the analytical model clear and focused. We believe that a meaningful model can be built upon only three characteristic parameter sets, describing main memory size, the I/O bandwidth and the disk bandwidth. We justify our approach by a practical implementation and a comparison of the theoretical to real performance values.
Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten