Systems, methods, and apparatus for subdividing data for storage in a dispersed data storage grid

• US 8,244,991 B2
• Filed: 10/08/2009
• Issued: 08/14/2012
• Est. Priority Date: 09/30/2005
• Status: Expired due to Fees

• Current Assignee: Pure Storage, Inc.
• Original Assignee: Cleversafe Incorporated (International Business Machines Corporation)
• Inventors: Gladwin, S. Christopher, England, Matthew M.
• Primary Examiner(s): CHOE, YONG J
• Application Number:
  US12/575,577
• Publication Number:
  US 20100023710A1
• Time in Patent Office: 1,041 Days
• Field of Search: 711/154, 711/E12.001, 711/161, 711/170, 709/219
• US Class Current: 711/154
• CPC Class Codes: G06F 21/6227 where protection concerns the structure of data, e.g. records, types, queries

Abstract

An efficient method for breaking source data into smaller data subsets and storing those subsets along with coded information about some of the other data subsets on different storage nodes such that the original data can be recreated from a portion of those data subsets in an efficient manner.

Claims

1. A computer comprises:

a communication network interface operably coupled to receive at least a threshold number of data slices for each of one or more strings of data, wherein a data slice of the threshold number of data slices includes a data value and a coded value;

a decoding module operably coupled to;

for each of the one or more strings of data;

decode, using a decoding algorithm, the at least the threshold number of data slices to produce “

n”

data values, wherein the “

n”

is a positive integer greater than the threshold number; and

reconstruct a string of data of the one or more strings of data from the “

n”

data values; and

reconstruct a computer file from the one or more strings of data; and

memory for storing at least a portion the computer file.

2. The computer of claim 1, wherein the decoding algorithm further comprises:

a Viterbi decoding algorithm.

3. The computer of claim 1, wherein the communication network interface further functions to:

receive the threshold number of data slices from a transmitting computer.

4. The computer of claim 1, wherein the communication network interface further functions to:

receives the at least the threshold number of data slices from at least some of plurality of storage nodes.

5. The computer of claim 4, wherein the communication network interface further functions to:

receive a first data slice of the “

n”

data slices of each of the one or more strings of data to a first storage node of the at least some of the a plurality of storage nodes;

receive a second data slice of the “

n”

data slices of each of the one or more strings of data to a second storage node of the at least some of the a plurality of storage nodes;

receive a third data slice of the “

n”

data slices of each of the one or more strings of data to a third storage node of the at least some of the a plurality of storage nodes; and

receive a fourth data slice of the “

n”

data slices of each of the one or more strings of data to a fourth storage node of the at least some of the a plurality of storage nodes.

6. The computer of claim 1 further comprises:

the memory storing the computer file, which is encrypted.

7. A method for execution by a computer, the method comprises:

receiving at least a threshold number of data slices for each of one or more strings of data, wherein a data slice of the threshold number of data slices includes a data value and a coded value;

for each of the one or more strings of data;

decoding, using a decoding algorithm, the at least the threshold number of data slices to produce “

n”

data values, wherein the “

n”

is a positive integer greater than the threshold number; and

reconstructing a string of data of the one or more strings of data from the “

n”

data values; and

reconstructing a computer file from the one or more strings of data; and

storing at least a portion of the computer file.

8. The method of claim 7, wherein the decoding algorithm further comprises:

a Viterbi decoding algorithm.

9. The method of claim 7 further comprises:

receiving the threshold number of data slices from a transmitting computer.

10. The method of claim 7 further comprises:

receiving the at least the threshold number of data slices from at least some of a plurality of storage nodes.

11. The method of claim 10 further comprises:

receiving a first data slice of the “

n”

data slices of each of the one or more strings of data to a first storage node of the at least some of the a plurality of storage nodes;

receiving a second data slice of the “

n”

data slices of each of the one or more strings of data to a second storage node of the at least some of the a plurality of storage nodes;

receiving a third data slice of the “

n”

data slices of each of the one or more strings of data to a third storage node of the at least some of the a plurality of storage nodes; and

receiving a fourth data slice of the “

n”

data slices of each of the one or more strings of data to a fourth storage node of the at least some of the a plurality of storage nodes.

12. The method of claim 7 further comprises:

storing the computer file, which is encrypted.

13. The method of claim 12 further comprises:

decrypting the computer file.