Optimizing a partition in data deduplication

A system for optimizing a partition of a data block into matching and non-matching segments in data deduplication using a processor device in a computing environment, the system comprising:

• a processor device operable in the computing storage environment, wherein the processor device for optimizing an input partition of the data block having both the matching segments and the non-matching segments:
• splits a sequence of the matching segments into sub-parts for obtaining a globally optimal subset;
• applies an optimal calculation operation on the sub-parts of the matching segments;
• combines solutions of the optimal calculation operation of the sub-parts into the optimal calculation operation for an entire range of the sequence of the matching segments;
• and
• builds the globally optimal subset by means of a first two-dimensional table represented by a matrix C[i, j], and storing a representation of the globally optimal subset in a second two-dimensional table represented by a matrix PS[i, j] that holds, at entry [i, j] of the matrix, the globally optimal subset for a plurality of parameters in form of a bit-string of length j−i+1, wherein i and j are indices of bit positions corresponding to segments.

A computer program product for optimizing a partition of a data block into matching and non-matching segments in data deduplication using a processor device in a computing environment, the computer program product comprising a non-transitory computer-readable storage medium having computer-readable program code portions stored therein, the computer-readable program code portions comprising:

• a first executable portion that splits a sequence of the matching segments into sub-parts for obtaining a globally optimal subset;
• applies an optimal calculation operation on the sub-parts of the matching segments;
• combines solutions of the optimal calculation operation of the sub-parts into the optimal calculation operation for an entire range of the sequence of the matching segments;
• and
• builds the globally optimal subset by means of a first two-dimensional table represented by a matrix C[i, j], and storing a representation of the globally optimal subset in a second two-dimensional table represented by a matrix PS[i, j] that holds, at entry [i, j] of the matrix, the globally optimal subset for a plurality of parameters in form of a bit-string of length j−i+1, wherein i and j are indices of bit positions corresponding to segments.