Scalable mechanism for detection of commonality in a deduplicated data set
View Patent ↗Mechanisms are provided for efficiently determining commonality in a deduplicated data set in a scalable manner regardless of the number of deduplicated files or the number of stored segments. Information is generated and maintained during deduplication to allow scalable and efficient determination of data segments shared in a particular file, other files sharing data segments included in a particular file, the number of files sharing a data segment, etc. Data need not be expanded or uncompressed. Deduplication processing can be validated and verified during commonality detection.
1. A method, comprising:
creating a datastore suitcase when a processor processes a file for deduplication;
generating a filemap corresponding to a deduplicated file, the filemap including a plurality of filemap indices, and a plurality of reference counts corresponding to a plurality of deduplicated data segments, wherein the plurality reference counts correspond to the number of files sharing corresponding deduplicated data segments;
modifying the datastore suitcase, the datastore suitcase including a plurality of datastore indices corresponding to the filemap indices, a plurality of deduplicated data segments, and a last file entry identifying last files having placed a reference to deduplicated data segments.
2. The method of claim 1 , wherein a first file has a first filemap with a NULL lname entry corresponding to a first data segment if a first deduplicated file was the last file to have placed a reference to the first data segment.
3. The method of claim 1 , wherein files sharing a particular data segment can be determined by accessing the last file entry for the particular data segment and traversing referencing filemaps until NULL entries are identified.
4. The method of claim 3 , wherein filenames corresponding to lnames are identified.
5. The method of claim 1 , wherein all files having data segments in common with a particular file are identified by analyzing a filemap for the particular file and identifying last file entries in the datastore suitcase for the data segments in the particular file.
6. The method of claim 1 , wherein referencing filemaps are traversed until NULL entries are identified.
7. A system, comprising:
a datastore suitcase is created when a deduplication system processor processes a file for deduplication;
the deduplication system processor configured to generate a filemap corresponding to a deduplicated file, the filemap including a plurality of filemap indices, and a plurality of reference counts corresponding to a plurality of deduplicated data segments, wherein the plurality of reference counts correspond to the number of files sharing corresponding deduplicated data segments;
a storage device configured to hold the datastore suitcase modified by the deduplication system processor, the datastore suitcase including a plurality of datastore indices corresponding to the filemap indices, a plurality of deduplicated data segments, and a last file entry identifying last files having placed a reference to deduplicated data segments.
8. The system of claim 7 , wherein a first file has a first filemap with a NULL lname entry corresponding to a first data segment if the first deduplicated file was the last file to have placed a reference to the first data segment.
9. The system of claim 7 , wherein files sharing a particular data segment can be determined by accessing the last file entry for the particular data segment and traversing referencing filemaps until NULL entries are identified.
10. The system of claim 9 , wherein filenames corresponding to lnames are identified.
11. The system of claim 7 , wherein all files having data segments in common with a particular file are identified by analyzing a filemap for the particular file and identifying last file entries in the datastore suitcase for the data segments in the particular file.
12. The system of claim 7 , wherein referencing filemaps are traversed until NULL entries are identified.
13. A non-transitory computer readable medium having computer code embodied therein, the computer readable medium, comprising:
computer code for creating a datastore suitcase when the processor processes a file for deduplication;
computer code for generating a filemap corresponding to a deduplicated file using the processor included in a deduplication system, the filemap including a plurality of filemap indices, a plurality of reference counts corresponding to a plurality of deduplicated data segments, wherein the plurality of reference counts correspond to the number of files sharing corresponding deduplicated data segments;
computer code modifying the datastore suitcase, the datastore suitcase including a plurality of datastore indices corresponding to the filemap indices, a plurality of deduplicated data segments, and a last file entry identifying last files having placed a reference to deduplicated data segments.
14. The computer readable medium of claim 13 , wherein a first file has a first filemap with a NULL lname entry corresponding to a first data segment if the first deduplicated file was the last file to have placed a reference to the first data segment.