DATA BLOCK SAVING SYSTEM AND METHOD

• US 20140164391A1
• Filed: 10/29/2013
• Published: 06/12/2014
• Est. Priority Date: 12/12/2012
• Status: Abandoned Application

• Current Assignee: Hong Fu Jin Precision Industry (Shenzhen) Co., Ltd. (Hon Hai Precision Industry Co., Ltd.), Hon Hai Precision Industry Co., Ltd.
• Original Assignee: Hong Fu Jin Precision Industry (Shenzhen) Co., Ltd. (Hon Hai Precision Industry Co., Ltd.), Hon Hai Precision Industry Co., Ltd.
• Inventors: CHAI, ZHI-QUAN, LI, DA-PENG, LIN, HAI-HONG, LEE, CHUNG-I
• Application Number:
  US14/065,483
• Publication Number:
  US 20140164391A1
• Time in Patent Office: Days
• US Class Current: 707/747
• CPC Class Codes: G06F 16/1748 De-duplication implemented within the file system, e.g. based on file segments de-duplication techniques in storage systems for the management of data blocks G06F3/0641

Abstract

An assignment server receives a data block of the file from a client. The assignment server determines if the obtained data block is a repetitive data block. The assignment server uploads the obtains data block from the client into a storage server when the obtained data block is not the repetitive data block.

Claims

1. An assignment server in electronic communication with a plurality of clients and a storage server, comprising:

at least one processor; and

a storage system that stores one or more programs, when executed by the at least one processor, cause the at least one processor to perform a data block saving method, the method comprising;

receiving a hash list corresponding to a file from the client, and saving the hash list corresponding to the file into a database connected to the assignment server, wherein the hash list comprises a hash value of each data block of the file;

calculating a transfer process usage ratio of each storage server and a remaining storage capacity of each storage server;

setting a sequence number of each data block;

obtaining a data block according to the sequence number of the data block and determining if the obtained data block is a repetitive data block;

skipping the obtained data block and obtains next data block according to the sequence number of each data block when the obtained data block is a repetitive data block; and

uploading the obtained data block from the client into the storage server when the obtained data block is not a repetitive data block.

2. The assignment server of claim 1, wherein a method of dividing the file by the client comprises:

the client divides each file into two or more data blocks;

the client calculates the hash value of each data block; and

the client saves the hash value of each data block into the hash list.

3. The assignment server of claim 1, wherein the sequence number of each data block is generated in an alphabetical order or in a numerical order.

4. The assignment server of claim 1, wherein the obtained data block is determined as a repetitive data block upon the condition that the hash values of the obtained data block is the same as the hash values of other data blocks in the storage server.

5. The assignment server of claim 1, wherein the obtained data block is determined as a repetitive data block upon the condition that the hash values of the obtained data block is the same as the hash values of other data blocks which is in a process of uploading into the storage server.

6. The assignment server of claim 1, wherein a method of saving the obtained data block into the storage sever comprises:

the storage sever calculates the hash value of the obtained data block uploaded from the assignment server;

the storage sever determines whether the hash value of the obtained data block exists in the hash list; and

the storage sever notifies the client to upload the obtained data block again when the hash value of the obtained data block does not exists in the hash list.

7. The assignment server of claim 1, wherein a method of downloading the file from the storage server comprises:

the client obtains the hash value of each data block of the file from the hash list stored in the database;

the client downloads each data block of the file according to a pointer of each data block from the storage server;

the client calculates a hash value of each downloaded data block, and determines if the hash value of each downloaded data block exists in the hash list stored in the database;

the client combines all downloaded data blocks to generate the file in the client according to the sequence number of each downloaded data block, when the hash value of each downloaded data block exists in the hash list stored in the database;

the client calculates the hash value of the generated file and determines if the calculated hash value of the generated file exists in the hash list stored in the database; and

the client displays the generated file when the calculated hash value of the generated file exists in the hash list stored in the database.

8. A data block saving method implemented by an assignment server, the assignment server in electronic communication with a plurality of clients and a storage server, the method comprising:

receiving a hash list corresponding to a file from the client, and saving the hash list corresponding to the file into a database connected to the assignment server, wherein the hash list comprises a hash value of each data block of the file, and a name of each data block;

calculating a transfer process usage ratio of each storage server and a remaining storage capacity of each storage server;

setting a sequence number of each data block;

obtaining a data block according to the sequence number of the data block and determining if the obtained data block is a repetitive data block;

skipping the obtained data block and obtains next data block according to the sequence number of each data block when the obtained data block is a repetitive data block; and

uploading the obtained data block from the client into the storage server when the obtained data block is not a repetitive data block.

9. The method of claim 8, wherein a method of dividing the file by the client comprises:

the client divides each file into two or more data blocks;

the client calculates the hash value of each data block; and

the client saves the hash value of each data block into the hash list.

10. The method of claim 8, wherein the sequence number of each data block is generated in an alphabetical order or in a numerical order.

11. The method of claim 8, wherein the obtained data block is determined as a repetitive data block upon the condition that the hash values of the obtained data block is the same as the hash values of other data blocks in the storage server.

12. The method of claim 8, wherein the obtained data block is determined as a repetitive data block upon the condition that the hash values of the obtained data block is the same as the hash values of other data blocks which is in a process of uploading into the storage server.

13. The method of claim 8, wherein a method of saving the obtained data block into the available storage sever comprises:

the storage sever calculates the hash value of the obtained data block uploaded from the assignment server;

the storage sever determines whether the hash value of the obtained data block exists in the hash list; and

the storage sever notifies the client to upload the obtained data block again when the hash value of the obtained data block does not exists in the hash list.

14. The method of claim 8, wherein a method of downloading the file from the storage server comprises:

the client obtains the hash value of each data block of the file from the hash list stored in the database;

the client downloads each data block of the file according to a pointer of each data block from the storage server;

the client calculates a hash value of each downloaded data block, and determines if the hash value of each downloaded data block exists in the hash list stored in the database;

the client combines all downloaded data blocks to generate the file in the client according to the sequence number of each downloaded data block, when the hash value of each downloaded data block exists in the hash list stored in the database;

the client calculates the hash value of the generated file and determines if the calculated hash value of the generated file exists in the hash list stored in the database; and

the client displays the generated file when the calculated hash value of the generated file exists in the hash list stored in the database.

15. A non-transitory computer-readable medium having stored thereon instructions that, when executed by an assignment server, the assignment server in electronic communication with a plurality of clients and a storage server, causing the assignment server to perform a data block saving method, the method comprising:

receiving a hash list corresponding to a file from the client, and saving the hash list corresponding to the file into a database connected to the assignment server, wherein the hash list comprises a hash value of each data block of the file, and a name of each data block;

calculating a transfer process usage ratio of each storage server and a remaining storage capacity of each storage server;

setting a sequence number of each data block;

obtaining a data block according to the sequence number of the data block and determining if the obtained data block is a repetitive data block;

skipping the obtained data block and obtains next data block according to the sequence number of each data block; and

uploading the obtained data block from the client into the storage server when the obtained data block is not the repetitive data block.

16. The non-transitory computer-readable medium of claim 15, wherein a method of dividing the file by the client comprises:

the client divides each file into two or more data blocks;

the client calculates the hash value of each data block; and

the client saves the hash value of each data block into the hash list.

17. The non-transitory computer-readable medium of claim 15, wherein the obtained data block is determined as a repetitive data block upon the condition that the hash values of the obtained data block is the same as the hash values of other data blocks in the storage server.

18. The non-transitory computer-readable medium of claim 15, wherein the obtained data block is determined as a repetitive data block upon the condition that the hash values of the obtained data block is the same as the hash values of other data blocks which is in a process of uploading into the storage server.

19. The non-transitory computer-readable medium of claim 15, wherein a method of saving the obtained data block into the available storage sever comprises:

the storage sever calculates the hash value of the obtained data block uploaded from the assignment server;

the storage sever determines whether the hash value of the obtained data block exists in the hash list; and

the storage sever notifies the client to upload the obtained data block again when the hash value of the obtained data block does not exists in the hash list.

20. The non-transitory computer-readable medium of claim 15, wherein a method of saving the obtained data block into the available storage sever comprises:

wherein a method of downloading the file from the storage server comprises;

the client obtains the hash value of each data block of the file from the hash list stored in the database;

the client downloads each data block of the file according to a pointer of each data block from the storage server;

the client calculates a hash value of each downloaded data block, and determines if the hash value of each downloaded data block exists in the hash list stored in the database;

the client combines all downloaded data blocks to generate the file in the client according to the sequence number of each downloaded data block, when the hash value of each downloaded data block exists in the hash list stored in the database;

the client calculates the hash value of the generated file and determines if the calculated hash value of the generated file exists in the hash list stored in the database; and

the client displays the generated file when the calculated hash value of the generated file exists in the hash list stored in the database.