Efficient calculation of similarity search values and digest block boundaries for data deduplication
US9244937B2 · kind B2 · utility
5Cited by
5References
15Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Mar 15, 2013 |
| Grant date | Jan 26, 2016 |
| Priority date | — |
| Expiry date | Nov 29, 2033 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/9535
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
For efficient calculation of both similarity search values and boundaries of digest blocks in data deduplication, input data is partitioned into chunks, and for each chunk a set of rolling hash values is calculated. A single linear scan of the rolling hash values is used to produce both similarity search values and boundaries of the digest blocks of the chunk.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.