Multi-Layer Data Storage Virtualization Using a Consistent Data Reference Model

• US 20150039849A1
• Filed: 11/07/2013
• Published: 02/05/2015
• Est. Priority Date: 08/02/2013
• Status: Abandoned Application

• Current Assignee: eBay Inc.
• Original Assignee: Formation Data Systems, Inc.
• Inventors: Lewis, Mark S.
• Application Number:
  US14/074,584
• Publication Number:
  US 20150039849A1
• Time in Patent Office: Days
• US Class Current: 711/203
• CPC Class Codes: G06F 12/109 for multiple virtual address spaces, e.g. segmentation G06F12/1036 takes precedence

Abstract

A write request that includes a data object is processed. A hash function is executed on the data object, thereby generating a hash value that includes a first portion and a second portion. A hypervisor table is queried with the first portion, thereby obtaining a master storage node identifier. The data object and the hash value are sent to a master storage node associated with the master storage node identifier. At the master storage node, a master table is queried with the second portion, thereby obtaining a storage node identifier. The data object and the hash value are sent from the master storage node to a storage node associated with the storage node identifier.

Claims

1. A method for processing a write request that includes a data object, the method comprising:

executing a hash function on the data object, thereby generating a hash value that includes a first portion and a second portion;

querying a hypervisor table with the first portion, thereby obtaining a master storage node identifier;

sending the data object and the hash value to a master storage node associated with the master storage node identifier;

at the master storage node, querying a master table with the second portion, thereby obtaining a storage node identifier; and

sending the data object and the hash value from the master storage node to a storage node associated with the storage node identifier.

2. The method of claim 1, wherein querying the hypervisor table with the first portion results in obtaining both the master storage node identifier and a second master storage node identifier, the method further comprising:

sending the data object and the hash value to a master storage node associated with the second master storage node identifier.

3. The method of claim 1, wherein querying the master table with the second portion results in obtaining both the storage node identifier and a second storage node identifier, the method further comprising:

sending the data object and the hash value from the master storage node to a storage node associated with the second storage node identifier.

4. The method of claim 1, wherein the write request further includes an application data identifier, the method further comprising:

updating a virtual volume catalog by adding an entry mapping the application data identifier to the hash value.

5. The method of claim 4, wherein the application data identifier comprises a file name, an object name, or a range of blocks.

6. The method of claim 1, wherein a length of the hash value is sixteen bytes.

7. The method of claim 1, wherein a length of the first portion is four bytes.

8. The method of claim 1, wherein a length of the second portion is two bytes.

9. The method of claim 1, wherein the master storage node identifier comprises an Internet Protocol (IP) address.

10. The method of claim 1, wherein the storage node identifier comprises an Internet Protocol (IP) address.

11. A method for processing a write request that includes a data object and a hash value of the data object, the method comprising:

storing the data object at a storage location;

updating a storage node table by adding an entry mapping the hash value to the storage location; and

outputting a write acknowledgment that includes the hash value.

12. A non-transitory computer-readable storage medium storing computer program modules for processing a read request that includes an application data identifier, the computer program modules executable to perform steps comprising:

querying a virtual volume catalog with the application data identifier, thereby obtaining a hash value of a data object, wherein the hash value includes a first portion and a second portion;

querying a hypervisor table with the first portion, thereby obtaining a master storage node identifier;

sending the hash value to a master storage node associated with the master storage node identifier;

at the master storage node, querying a master table with the second portion, thereby obtaining a storage node identifier; and

sending the hash value from the master storage node to a storage node associated with the storage node identifier.

13. The computer-readable storage medium of claim 12, wherein the steps further comprise receiving the data object.

14. The computer-readable storage medium of claim 12, wherein querying the hypervisor table with the first portion results in obtaining both the master storage node identifier and a second master storage node identifier, and wherein the steps further comprise:

waiting for a response from the master storage node associated with the master storage node identifier; and

responsive to no response being received within a specified time period, sending the hash value to a master storage node associated with the second master storage node identifier.

15. The computer-readable storage medium of claim 12, wherein querying the master table with the second portion results in obtaining both the storage node identifier and a second storage node identifier, and wherein the steps further comprise:

at the master storage node, waiting for a response from the storage node associated with the storage node identifier; and

responsive to no response being received within a specified time period, sending the hash value from the master storage node to a storage node associated with the second storage node identifier.

16. A computer system for processing a read request that includes a hash value of a data object, the system comprising:

a non-transitory computer-readable storage medium storing computer program modules executable to perform steps comprising;

querying a storage node table with the hash value, thereby obtaining a storage location; and

retrieving the data object from the storage location; and

a computer processor for executing the computer program modules.

17. The system of claim 16, wherein the steps further comprise outputting the data object.