Database Reference
In-Depth Information
Figure 15.4
presents the performance comparison of the two algorithms. A star
above a column in the graphs indicates that an exact hiding solution could not be
found and the algorithm resorted to an approximate solution. Based on the pre-
sented experimental results, the following observations can be made. First, by con-
struction, the two-phase iterative algorithm [27] is constantly superior to the inline
algorithm [23], since its worst performance equals the performance of the inline
scheme. Second, as the experiments indicate, there are several settings in which the
two-phase iterative algorithm finds an optimal hiding solution (with a small incre-
ment in the distance) that is missed by the inline algorithm. Third, by construction,
the two-phase iterative algorithm can capture all the exact solutions that were also
identified by the inline approach. This fact, constitutes the two-phase iterative algo-
rithm superior, when compared to the inline algorithm.
