Block-level data de-duplication using thinly provisioned...

Details Block-level data de-duplication using thinly provisioned... Block-level data de-duplication using thinly provisioned...

2009-07-16

2011-11-01

Lu, Kuen (Department: 2156)

Data processing: database and file management or data structures

Data integrity

Data cleansing, data scrubbing, and deleting duplicates

C707S812000, C707S821000, C707S797000, C711S114000, C711S118000

Reexamination Certificate

active

08051050

ABSTRACT:
Data segments are logically organized in groups in a data repository. Each segment is stored at an index in the data repository. In association with a write request, a hash algorithm is applied to the data segment to generate a group identifier. Each group is identifiable by a corresponding group identifier. The group identifier is applied to a hash tree to determine whether a corresponding group in the data repository exists. Each existing group in the data repository corresponds to a leaf of the hash tree. If no corresponding group exists in the data repository, the data segment is stored in a new group in the data repository. However, if a corresponding group exists, the group is further searched to determine if a data segment matching the data segment to be stored is already stored. The data segment can be stored in accordance with the results of the search.

REFERENCES:
patent: 7962706 (2011-06-01), Davis
patent: 2008/0155192 (2008-06-01), Iitsuka
patent: 2011/0004639 (2011-01-01), Williams

Affiliated with

Also associated with

Rating

Block-level data de-duplication using thinly provisioned... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Block-level data de-duplication using thinly provisioned..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Block-level data de-duplication using thinly provisioned... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4275676