SELECTING A STORE FOR DEDUPLICATED DATA

• US 20160077924A1
• Filed: 05/16/2013
• Published: 03/17/2016
• Est. Priority Date: 05/16/2013
• Status: Active Grant

• Current Assignee: Hewlett Packard Enterprise Development LP (Hewlett-Packard Enterprise Company)
• Original Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Inventors: Todd, Andrew, Camble, Peter Thomas, Jeong, Wayland Kenneth, Chandrasekharan, Kaushik, Suehr, Dennis
• Granted Patent: US 10,592,347 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 11/1435 using file system or storage system metadata
• CPC Class Codes: G06F 11/1448 Management of the data involved in backup or backup restore
• CPC Class Codes: G06F 11/1453 using de-duplication of the data
• CPC Class Codes: G06F 11/1464 for networked environments
• CPC Class Codes: G06F 16/137 Hash-based content-based indexing of textual data G06F16/31
• CPC Class Codes: G06F 16/1752 based on file chunks
• CPC Class Codes: G06F 2201/80 Database-specific techniques
• CPC Class Codes: G06F 2201/84 Using snapshots, i.e. a logical point-in-time copy of the data

Abstract

A technique includes communicating a plurality of hashes associated with chunks of an object to at least some stores of a plurality of stores on which the object is distributed; and in response to the communication, receiving responses indicating a distribution of the associated chunks. The technique includes selecting one of the stores based at least in part on the responses and communicating deduplicated data associated with the object to the selected store.

Claims

1. A method comprising:

communicating a plurality of hashes associated with chunks of an object to at least some stores of a plurality of stores on which the object is distributed;

in response to the communication, receiving responses indicating a distribution of the associated chunks;

selecting one of the stores based at least in part on the responses; and

communicating deduplicated data associated with the object to the selected store.

2. The method of claim 1, wherein communicating the plurality of hashes comprises communicating a subset of hashes of a larger set of hashes associated with the chunks.

3. The method of claim 2, further comprising:

in response to selecting the one of the stores, communicating hashes to the selected store so that all of the hashes of the larger set of hashes are communicated to the selected store; and

regulating the communication of the deduplicated data to the selected store based at least in part on a response of the selected store to the communication of hashes to the selected store.

4. The method of claim 1, wherein receiving the responses comprises receiving count values from each of the at least one store, each count value being indicative of a number of the hashes associated with chunks on the store.

5. The method of claim 1, further comprising:

communicating to each of the non-selected stores an indication that the non-selected store will not be receiving the deduplicated data.

6. A system comprising:

a plurality of team members to store a distributed teamed object,

wherein at least some of the team members are to receive a plurality of hashes associated with chunks of the teamed object, in response to the communication, communicate responses indicating a distribution of the associated chunks, and interact with an application to receive deduplicated data based at least in part on the communication of the responses.

7. The system of claim 6, wherein the team members are to receive a sparse set of hashes indicative of the chunks.

8. The system of claim 6, wherein at least one of the team members is to, in response to being selected, receive a larger set of hashes and regulate communication of the deduplicated data to the team member based at least in part on the communication of the larger set of hashes.

9. The system of claim 6, wherein at least one of the team members is to communicate a count value indicative of a number of the hashes associated with chunks stored on the team member.

10. The system of claim 6, wherein at least one of the team members is to, response to not being selected, receive an indication that the team member will not receive the deduplicated data.

11. An article comprising a computer readable non-transitory storage medium to store instructions that when executed by a computer cause the computer to:

communicate a plurality of hashes associated with chunks of an object to at least some stores of a plurality of stores on which the object is distributed;

in response to the communication, receive responses indicating a distribution of the associated chunks;

select one of the stores based at least in part on the responses; and

communicate deduplicated data associated with the object to the selected store.

12. The article of claim 11, the storage medium storing instructions that when executed by the computer cause the computer to communicate a subset of hashes of a larger set of hashes associated with the chunks.

13. The article of claim 12, the storage medium storing instructions that when executed by the computer cause the computer to:

in response to selecting the one of the stores, communicate hashes to the selected store so that all of the hashes of the larger set of hashes are communicated to the selected store; and

regulate the communication of the deduplicated data to the selected store based at least in part on a response of the selected store to the communication of hashes to the selected store.

14. The article of claim 11, the storage medium storing instructions that when executed by the computer cause the computer to receive count values from each of the at least one store, each count value being indicative of a number of the hashes associated with chunks on the store.

15. The article of claim 11, the storage medium storing instructions that when executed by the computer cause the computer to communicate to each of the non-selected stores an indication that the non-selected store will not be receiving the deduplicated data.