Deterministic space management in deduplication applications

Details Deterministic space management in deduplication applications Deterministic space management in deduplication applications

2011-04-05

2011-04-05

Rones, Charles (Department: 2164)

Data processing: database and file management or data structures

Data integrity

Data cleansing, data scrubbing, and deleting duplicates

Reexamination Certificate

active

07921086

ABSTRACT:
Deterministic space management queries are answered in a deduplication context. A block subkey data structure comprises a subkey (a subset of the bits of a corresponding hash key identifying a block) and refcount (an indication of the total number of objects that reference a given block) for each block in a deduplication store. For each object, an object subkey data structure is maintained. An object subkey data structure comprises a list of subkeys corresponding to blocks referenced by that object. To answer a space management query concerning a given object set, a corresponding object set subkey data structure is created, comprising an entry for each block referenced by at least one object in the object set. Each entry comprises a subkey identifying that block and an object set refcount for that block. The data structures are utilized to efficiently answer space management queries.

REFERENCES:
patent: 2007/0050423 (2007-03-01), Whalen et al.
patent: 2008/0098083 (2008-04-01), Shergill et al.

Affiliated with

Also associated with

Rating

Deterministic space management in deduplication applications does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Deterministic space management in deduplication applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Deterministic space management in deduplication applications will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2679973