Data restoration utilizing redundancy data

• US 9,922,111 B1
• Filed: 11/29/2015
• Issued: 03/20/2018
• Est. Priority Date: 11/04/2003
• Status: Active Grant

• Current Assignee: K.Mizra LLC
• Original Assignee: Spectrum Patents, Inc. (Brian Yates)
• Inventors: Emigh, Aaron, Roskind, James
• Primary Examiner(s): Arjomandi, Noosha
• Application Number:
  US14/953,379
• Time in Patent Office: 842 Days
• CPC Class Codes: G06F 11/1453 using de-duplication of the data
• CPC Class Codes: G06F 11/1458 Management of the backup or restore process
• CPC Class Codes: G06F 11/1464 for networked environments
• CPC Class Codes: G06F 11/1469 Backup restoration techniques
• CPC Class Codes: G06F 11/2094 Redundant storage or storage space G06F11/2056 takes precedence
• CPC Class Codes: G06F 16/284 Relational databases
• CPC Class Codes: G06F 21/6218 to a system of files or objects, e.g. local or distributed file system or database
• CPC Class Codes: G06F 2201/84 Using snapshots, i.e. a logical point-in-time copy of the data
• CPC Class Codes: G06F 2221/2103 Challenge-response
• CPC Class Codes: Y10S 707/99943 Generating database or data structure, e.g. via user interface

Abstract

In some embodiments, techniques for data backup and restoration comprise creating a redundancy data element by computing an erasure correcting code on elements of data from a first set of computers that includes a first computer and a second computer, wherein the elements of data includes a first data element from the first computer and a second data element from the second computer; transmitting the redundancy data element to a third computer for storage thereon; receiving a request for data restoration relating to the first data element; creating a restoration data, wherein the restoration data is a reconstruction of the first data element, wherein creating the restoration data includes computing an erasure correcting code on elements of data that include the second data element and the redundancy data element; and providing the restoration data responsive to the request for data restoration.

Claims

1. A method, comprising:

creating a redundancy data element by computing an erasure correcting code on elements of data from a first set of computers selected from among a plurality of computers connected by a digital network, wherein the plurality of computers includes a first computer and a second computer, wherein the first set of computers includes the first computer and the second computer, and wherein the elements of data from the first set of computers includes a first data element from the first computer and a second data element from the second computer;

transmitting the redundancy data element to a third computer for storage thereon;

receiving a request for data restoration relating to the first data element;

creating a restoration data, wherein the restoration data is a reconstruction of the first data element, wherein creating the restoration data includes computing an erasure correcting code on elements of data from a second set of computers, wherein the second set of computers includes the second computer and the third computer, and wherein the elements of data from the second set of computers includes the second data element and the redundancy data element; and

providing the restoration data responsive to the request for data restoration.

2. The method of claim 1, wherein the elements of data from the first set of computers are stripes.

3. The method of claim 1, wherein the erasure correcting code is a parity code.

4. The method of claim 1, wherein the erasure correcting code is an algebraic bock code.

5. The method of claim 4, wherein the algebraic block code is a Reed-Solomon code.

6. The method of claim 1, wherein the first data element is encrypted.

7. The method of claim 1, wherein computing the erasure correcting code is performed in a centralized mode.

8. The method of claim 1, wherein computing the erasure correcting code is performed in a peer-to-peer mode.

9. A system, comprising:

a processor configured to;

create a redundancy data element by computing an erasure correcting code on elements of data from a first set of computers selected from among a plurality of computers connected by a digital network, wherein the plurality of computers includes a first computer and a second computer, wherein the first set of computers includes the first computer and the second computer, and wherein the elements of data from the first set of computers includes a first data element from the first computer and a second data element from the second computer;

transmit the redundancy data element to a third computer for storage thereon;

receive a request for data restoration relating to the first data element;

create a restoration data, wherein the restoration data is a reconstruction of the first data element, wherein creating the restoration data includes computing an erasure correcting code on elements of data from a second set of computers, wherein the second set of computers includes the second computer and the third computer, and wherein the elements of data from the second set of computers includes the second data element and the redundancy data element; and

provide the restoration data responsive to the request for data restoration; and

a memory coupled to the hardware processor and configured to provide instructions to the processor.

10. The system of claim 9, wherein the elements of data from the first set of computers are stripes.

11. The system of claim 9, wherein the erasure correcting code is a parity code.

12. The system of claim 9, wherein the erasure correcting code is an algebraic bock code.

13. The system of claim 12, wherein the algebraic block code is a Reed-Solomon code.

14. The system of claim 9, wherein the first data element is encrypted.

15. A computer program product, embodied in a non-transitory computer readable medium and comprising computer instructions for:

creating a redundancy data element by computing an erasure correcting code on elements of data from a first set of computers selected from among a plurality of computers connected by a digital network, wherein the plurality of computers includes a first computer and a second computer, wherein the first set of computers includes the first computer and the second computer, and wherein the elements of data from the first set of computers includes a first data element from the first computer and a second data element from the second computer;

transmitting the redundancy data element to a third computer for storage thereon;

receiving a request for data restoration relating to the first data element;

creating a restoration data, wherein the restoration data is a reconstruction of the first data element, wherein creating the restoration data includes computing an erasure correcting code on elements of data from a second set of computers, wherein the second set of computers includes the second computer and the third computer, and wherein the elements of data from the second set of computers includes the second data element and the redundancy data element; and

providing the restoration data responsive to the request for data restoration.

16. The computer program product of claim 15, wherein the elements of data from the first set of computers are stripes.

17. The computer program product of claim 15, wherein the erasure correcting code is a parity code.

18. The computer program product of claim 15, wherein the erasure correcting code is an algebraic bock code.

19. The computer program product of claim 18, wherein the algebraic block code is a Reed-Solomon code.

20. The computer program product of claim 15, wherein the first data element is encrypted.