Similarly to the variations for the basic underflow strategy one can design variations for the basic minimum-overlaps strategy. For example, one can aim to limit the |R'k| by XR and the |Q'k| by XQ as done in section 9.2.2 but this time also minimising the total number of overlapping tuples. This variation of basic algorithm of figure 9.10 is shown in figure 9.12.
The major problem of the two versions of the minimum-overlaps strategy is the run time complexity of O(N2). The only possibility to ease this problem is to decrease N, e.g. by using condensed or endpoint IP-tables. A further possible reduction method is the black-out preprocessing technique which is described in the following section.