PATENT CLAIM ANALYSIS

Application Number: 15909613
Application Type: Utility
Filing Date: 2018-03
Publication Date: 2018-07
Patent Classification: ["711", "101000"]

Abstract:
Embodiments of the present disclosure disclose a solution for data backup and recovery in a storage system. When a source device in the storage system backs up, to a backup-end device, a data block that is written after a snapshot S n , the source device performs a logical operation such as an exclusive-NOR or exclusive-OR operation on the written data block and an original data block, which is recorded in the snapshot S n , of the written data block, and then compresses a data block obtained after the logical operation, which improves a compression ratio of a data block, thereby reducing an amount of data that is sent to the backup-end device, and saving transmission bandwidth. The solution may be further applied to a scenario of data recovery in a storage system.

Claim (Index 2):
The storage device according to  claim 1 , wherein the following calculation rule is configured for the storage device: N windows are set, and hash calculation is performed on at least partial data, which is in each window, of a data block, wherein a size of each window is the same; a start location of a first window is a start location of the data block; an end location of a last window is an end location of the data block; a start location of an (i+1) th  window is a fixed length away from a start location of an i th  window; and N is an integer and is not less than 2, i is an integer, and the i th  window indicates any window of a first to an N th  windows; and the processor is specifically configured to:\n perform hash calculation on at least partial data, which is in each window, of the first data block according to the calculation rule, and perform hash calculation on at least partial data, which is in each window, of the second data block according to the calculation rule; select, according to an order in which hash values are set, the first M hash values from hash values of the first data block, and select the first M hash values from hash values of the second data block, wherein M is a positive integer and is not greater than N; and search the first M hash values of the first data block and the first M hash values of the second data block for a same hash value, and determine that a difference between offsets of two windows corresponding to the same hash value is the shift amount.

Metadata:
- Claim Count in Document: 3.0
- Percentile: 90.0
- Lexical Diversity: 2.21538
- Patent Class: 711.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: False
- Related Applications: ['14062669', '14091962', '14092169', '14260044', '14772594']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.5179938174801746
- 35 USC 102 Novelty (BERT): 0.4861103246233859
- Combined Prediction Score: 0.5148054681944957
- Mean Citation Score: 160.46121599999995
- Max Citation Score: 185.92665
- Similarity Product: 133.49409253048003

Labels:
- Claim Label 101: 1
- Claim Label 102: 1
- Claim Label 103: 1
- Claim Label 112: 1
- Combined Label: 1
- Label 101 Adjusted: 1

Dataset: test