IP Library Granted Patent US 8,074,049
Granted Patent B2
US 8,074,049 · App. 12/490,542 · Granted Dec 6, 2011

Online backup system with global two staged deduplication without using an indexing database

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 8,074,049
App. No.
12/490,542
Granted
Dec 6, 2011
Kind
B2
Abstract

An encryption for a distributed global online backup system with global two-stage deduplication in the absence of an indexing database where data blocks are encrypted using their SHA-1 signatures as encryption keys.

Claims (52)

1. A method for storing information on a computer, comprising:

selecting data to be backed up on the computer;

authenticating at least one of a user and an account for the data to be backed up on the computer;

preparing a hash code for the selected data;

sending the hash code for the data to be backed up from a front end arrangement configured to interface with a user to a back end arrangement;

checking data of at least one of a scheme data partition map and a replica group membership map for the hash code obtained from the front end arrangement;

determining which of a set of replica group members can service storage of the selected data in a storage brick;

connecting the front end arrangement to the selected storage brick through the replica group members determined for storing the selected data;

searching a hash code key queue for the hash code from the selected data;

storing the selected data in the selected storage brick altering the memory of the storage brick when the hash code of the selected data is not in the hash code key queue; and

updating the hash code key queue with the hash code from the selected data.

2. The method according to claim 1 , further comprising:

determining a maximum data block size to be saved of the selected data;

checking a block size of the selected data with the maximum data block size; and

storing the selected data when then maximum data block size is not exceeded by the block size of the selected data.

3. The method according to claim 2 , further comprising:

dividing the block size of the selected data when the maximum data block size is exceeded by the block size of the selected data.

4. The method according to claim 3 , further comprising:

checking a capacity of a storage brick to store data;

comparing the capacity of the storage brick to the block size of the divided selected data; and

storing the data of the divided block of the selected data when the capacity of the storage brick exceeds the block size of the divided selected data.

5. The method according to claim 3 , further comprising:

storing the divided block of selected data in a storage brick.

6. The method according to claim 5 , wherein the storing the divided block is in an encrypted format.

7. The method according to claim 1 , wherein the storing the selected data when the hash code of the selected data is not in the hash code key queue is in an encrypted format.

8. A method for restoring information saved in a memory of a computer, comprising:

selecting data to be restored on the computer, the data previously stored on the computer;

authenticating at least one of a user and an account for the data to be restored on the computer;

sending a hash code from a front end arrangement configured to interface with a user to a back end arrangement for one of authenticated users and accounts;

checking data of at least one of a scheme data partition map and a replica group membership map for the hash code obtained from the front end arrangement;

determining which replica group members can access a storage brick containing the selected data;

connecting the front end arrangement to the selected storage brick for storing the selected data;

searching a hash code key queue for the hash code from the selected data;

retrieving the selected data from the storage brick when the hash code of the selected data is in the hash code key queue; and

visually displaying the selected data.

9. The method according to claim 8 , further comprising:

decoding selected data retrieved from the storage brick.

10. A method for dividing data to be saved on a computer, comprising:

determining a free space in a storage brick memory for a computer system;

selecting an original block of data to be saved on the computer;

retrieving a scheme data partition map;

determining a data separation point in the block of data to be saved on the computer based upon the scheme data partition map;

locking the block of data by the computer system so that a state may not be changed of the block of data; and

copying the block of data into portions of the storage brick memory as determined by the data separation point.

11. The method according to claim 10 , further comprising:

deleting the original block of data on the computer.

12. The method according to claim 10 , further comprising:

confirming the copying of the block of data into portions as determined by the data separation point.

13. The method according to claim 12 , further comprising:

unlocking the portions of the block of data.

14. The method according to claim 13 , further comprising:

updating at least a scheme data partition map and a replica group map with the copying of the block of data into portions.

Assignments (4)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 14, 2015
From: IMATION CORP.
To: SONY CORPORATION
Reel/Frame 036354/0980 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 23, 2012
From: NINE TECHNOLOGY, LLC
To: IMATION CORP.
Reel/Frame 027753/0879 →
CHANGE OF NAME Recorded May 6, 2011
From: VAULT USA, LLC
To: NINE TECHNOLOGY, LLC
Reel/Frame 026240/0909 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 24, 2009
From: GELSON, THOMAS M.; STOEV, ALEXANDER
To: VAULT USA, LLC
Reel/Frame 022870/0098 →