REPETITIVE DATA BLOCK DELETING SYSTEM AND METHOD
First Claim
Patent Images
1. An analysis device in electronic communication with a plurality of servers in a server cluster, each server comprising data blocks of files, 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 repetitive data block deleting method, the method comprising;
monitoring an available storage capacity of each storage space in each server of the server cluster;
obtaining all hash lists from all databases of the server cluster when the available storage capacity of one storage space does not exceed a predetermined storage capacity;
searching for each repetitive hash value from the obtained hash lists, and repetitive data blocks corresponding to the repetitive hash value;
obtaining a maximum storage space according to a pointer corresponding to each repetitive data block, and sending the pointer corresponding to the repetitive data block in the maximum storage space to other servers; and
deleting repetitive data blocks from the other servers.
3 Assignments
0 Petitions
Accused Products
Abstract
An analysis device obtains hash lists from databases of a server cluster. The analysis device determines repetitive hash values and repetitive data blocks. The analysis device deletes the repetitive data blocks from servers of the server cluster.
5 Citations
15 Claims
-
1. An analysis device in electronic communication with a plurality of servers in a server cluster, each server comprising data blocks of files, 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 repetitive data block deleting method, the method comprising; monitoring an available storage capacity of each storage space in each server of the server cluster; obtaining all hash lists from all databases of the server cluster when the available storage capacity of one storage space does not exceed a predetermined storage capacity; searching for each repetitive hash value from the obtained hash lists, and repetitive data blocks corresponding to the repetitive hash value; obtaining a maximum storage space according to a pointer corresponding to each repetitive data block, and sending the pointer corresponding to the repetitive data block in the maximum storage space to other servers; and deleting repetitive data blocks from the other servers. - View Dependent Claims (2, 3, 4, 5)
-
-
6. A repetitive data block deleting method implemented by an analysis device, the analysis device in electronic communication with a plurality of servers in a server cluster, each server comprising data blocks of files, the method comprising:
-
monitoring an available storage capacity of each storage space in each server of the server cluster; obtaining all hash lists from all databases of the server cluster when the available storage capacity of one storage space does not exceed a predetermined storage capacity; searching for each repetitive hash value from the obtained hash lists, and repetitive data blocks corresponding to the repetitive hash value; obtaining a maximum storage space according to a pointer corresponding to each repetitive data block, and sending the pointer corresponding to the repetitive data block in the maximum storage space to other servers; and deleting repetitive data blocks from the other servers. - View Dependent Claims (7, 8, 9, 10)
-
-
11. A repetitive data block deleting method implemented by an analysis device, the analysis device in electronic communication with a plurality of servers in a server cluster, each server comprising data blocks of files, the method comprising:
-
setting a trigger event in each database of the server cluster; triggering each database by the trigger event to send all hash lists to the analysis device when the number of the hash lists stored in the database exceeds a predetermined number; searching for each repetitive hash value from the obtained hash lists, and repetitive data blocks corresponding to the repetitive hash value; obtaining a maximum storage space according to a pointer corresponding to each repetitive data block, and sending the pointer corresponding to the repetitive data block in the maximum storage space to other servers; and deleting repetitive data blocks from the other servers. - View Dependent Claims (12, 13, 14, 15)
-
Specification