Optimizing a partition in data deduplication
US9626374B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Dec 4, 2014 |
| Grant date | Apr 18, 2017 |
| Priority date | — |
| Expiry date | May 28, 2035 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/2282
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.