Invention Grant
- Patent Title: Optimizing hash table structure for digest matching in a data deduplication system
-
Application No.: US13941951Application Date: 2013-07-15
-
Publication No.: US10339109B2Publication Date: 2019-07-02
- Inventor: Lior Aronovich
- Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
- Applicant Address: US NY Armonk
- Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
- Current Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
- Current Assignee Address: US NY Armonk
- Agency: Griffiths & Seaton PLLC
- Main IPC: G06F16/174
- IPC: G06F16/174 ; G06F17/00

Abstract:
Repository data intervals are determined as similar to an input data interval. Repository digests corresponding to the similar repository data interval are loaded into a sequential representation and into a search structure. Matches of input digests and the repository digests are found using the search structure. Each one of the found matches of the input digests and repository digests are extended using the sequential representation. Data matches are determined between the input data and the repository data using extended matches of digests. A compact index pointing to a position in the sequential representation of digests is incorporated into entries of the search structure.
Public/Granted literature
- US20150019507A1 OPTIMIZING HASH TABLE STRUCTURE FOR DIGEST MATCHING IN A DATA DEDUPLICATION SYSTEM Public/Granted day:2015-01-15
Information query