发明名称 |
OPTIMIZING A PARTITION IN DATA DEDUPLICATION |
摘要 |
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, a sequence of matching segments is split into sub-parts for obtaining a globally optimal subset, to which an optimal calculation is applied. The solutions of optimal calculations for the entire range of the sequence are combined, and a globally optimal subset is built 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. |
申请公布号 |
US2015088843(A1) |
申请公布日期 |
2015.03.26 |
申请号 |
US201414560261 |
申请日期 |
2014.12.04 |
申请人 |
INTERNATIONAL BUSINESS MACHINES CORPORATION |
发明人 |
HIRSCH Michael;ISH-SHALOM Ariel J.;KLEIN Shmuel T. |
分类号 |
G06F17/30 |
主分类号 |
G06F17/30 |
代理机构 |
|
代理人 |
|
主权项 |
1. A method 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 method comprising:
splitting a sequence of the matching segments into sub-parts for obtaining a globally optimal subset; applying an optimal calculation operation on the sub-parts of the matching segments; combining 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 building 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. |
地址 |
Armonk NY US |