Object interface to a dispersed data storage network

• US 8,892,698 B2
• Filed: 09/09/2013
• Issued: 11/18/2014
• Est. Priority Date: 10/09/2007
• Status: Active Grant

• Current Assignee: Pure Storage, Inc.
• Original Assignee: Cleversafe Incorporated (International Business Machines Corporation)
• Inventors: Baptist, Andrew, Palthepu, Srinivas, Gladwin, S. Christopher, Dhuse, Greg, Mark, Zachary J., Thornton, Vance T., Quigley, John
• Primary Examiner(s): DINH, KHANH Q
• Application Number:
  US14/021,037
• Publication Number:
  US 20140012899A1
• Time in Patent Office: 435 Days
• Field of Search: 709/220, 709/226, 709/228, 709/224
• US Class Current: 709/220
• CPC Class Codes: G06F 16/168 Details of user interfaces specifically adapted to file systems, e.g. browsing and visualisation, 2d or 3d GUIs query results presentation G06F16/156
• CPC Class Codes: G06F 16/182 Distributed file systems

Abstract

A data object interface to a dispersed data storage network is disclosed. The disclosed interface accepts read and write commands from a client computer and generates network commands that are forwarded to slice servers that form the storage component of the dispersed data storage network. The slice servers then fulfill the read and write commands.

Claims

1. A method for execution by a computing device, the method comprises:

assigning a data object identifier (DOI) to a data object;

partitioning a data object into a plurality of blocks;

encoding the plurality of blocks using an information dispersal algorithm to generate a plurality of sets of data slices, wherein a first set of the plurality of sets of data slices is generated from a first block and a second set of the plurality of sets of data slices is generated from a second block;

transmitting the plurality of sets of data slices to a plurality of slice servers within a dispersed data storage network, wherein a first data slice of a first set of the plurality of sets of data slices and a first data slice of a second set of the plurality of sets of data slices are transmitted to a first slice server, wherein a second data slice of the first set of the plurality of sets of data slices and a second data slice of the second set of the plurality of sets of data slices are transmitted to a second slice server, wherein each data slice within each set of the plurality of sets of data slices is transmitted to a different slice server of the plurality of slice servers;

generating an information record for the data object for use to retrieve a minimum number of data slices of the plurality of sets of data slices required to reconstruct the data object, wherein the information record specifies the DOI for the data object, identity of each block of the plurality of blocks, identity of each set of the plurality of sets of data slices, and identity of each data slice within the plurality of sets of data slices, wherein each data slice is also identified by that corresponding set of the plurality of sets of data slices and that corresponding block of the plurality of block from which that that data slice was generated; and

transmitting the information record, which identifies the data object, for storage in a database within the dispersed data storage network.

2. The method of claim 1 further comprising:

accepting a name; and

generating the (DOI) from the name using a hashing function.

3. The method of claim 1 further comprising:

randomly generating the (DOI) based on a randomly generated number.

4. A dispersed data storage unit comprises:

a network port;

a dispersed data storage application configured to;

assign a data object identifier (DOI) to a data object;

partition a data object into a plurality of blocks;

encode the plurality of blocks using an information dispersal algorithm to generate a plurality of sets of data slices, wherein a first set of the plurality of sets of data slices is generated from a first block and a second set of the plurality of sets of data slices is generated from a second block;

transmit, via the network port, the plurality of sets of data slices to a plurality of slice servers within a dispersed data storage network, wherein a first data slice of a first set of the plurality of sets of data slices and a first data slice of a second set of the plurality of sets of data slices are transmitted to a first slice server, wherein a second data slice of the first set of the plurality of sets of data slices and a second data slice of the second set of the plurality of sets of data slices are transmitted to a second slice server, wherein each data slice within each set of the plurality of sets of data slices is transmitted to a different slice server of the plurality of slice servers;

generate an information record for the data object for use to retrieve a minimum number of data slices of the plurality of sets of data slices required to reconstruct the data object, wherein the information record specifies the DOI for the data object, identity of each block of the plurality of blocks, identity of each set of the plurality of sets of data slices, and identity of each data slice within the plurality of sets of data slices, wherein each data slice is also identified by that corresponding set of the plurality of sets of data slices and that corresponding block of the plurality of block from which that that data slice was generated; and

transmit, via the network port, the information record, which identifies the data object, for storage in a database within the dispersed data storage network.

5. The dispersed data storage unit of claim 4, wherein the dispersed data storage application is further configured to:

generate the (DOI) by applying a hashing function to a name.

6. The dispersed data storage unit of claim 4, wherein the dispersed data storage application is further configured to:

generate, via a randomly generated process, the (DOI) based on a randomly generated number.