PATENT CLAIM ANALYSIS

Application Number: 15918130
Application Type: Utility
Filing Date: 2018-03
Publication Date: 2019-09
Patent Classification: ["711", "108000"]

Abstract:
The subject matter described herein is generally directed to detecting and managing collisions in storage. A hash identifier (ID) for a first block of data is calculated and a determination is made whether the calculated hash ID matches hash IDs associated with a storage. If the calculated hash ID matches at least one of the hash IDs, the first block of data is compared with a second block of data, associated with the hash IDs, in the storage. If the first block of data is different from the second block of data based on the comparison, a hash number is associated with the calculated hash ID and the first block of data is stored in storage using the calculated hash ID and associated hash number as an index to the first block of data in the storage. In this manner, collision between data blocks is detected and prevented.

Claim (Index 20):
The one or more non-transitory computer storage media of  claim 15 , wherein the storage has a plurality of domains associated therewith, each of the plurality of domains corresponding to a defined set of data in the storage, and wherein the computer-executable instructions further cause the processor to at least perform operations comprising:\n associating the calculated hash ID and the hash number with a domain ID associated with a first domain, of the plurality of domains, to which the first block of data belongs. moving the first block of data from the first domain to a second domain; determining whether the calculated hash ID matches any of a plurality of hash IDs in the second domain; and upon determining that the calculated hash ID matches at least one of the plurality of hash IDs in the second domain:\n comparing the first block of data with a third block of data, in the second domain, associated with the at least one of the plurality of hash IDs; and \n upon the first block of data being different from the third block of data based on the comparison, associate a second hash number and a domain ID with the calculated hash ID, storing the first block of data in the second domain using the calculated hash ID, associated hash number and associated domain ID as an index to the first block of data in the second data, and linking the domain ID between the first and second domains.

Metadata:
- Claim Count in Document: 50.0
- Percentile: 90.0
- Lexical Diversity: 2.53968
- Patent Class: 711.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['15885027', '14037577', '14098760', '15270462', '15624796']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.4871613477890029
- 35 USC 102 Novelty (BERT): 0.461029803576817
- Combined Prediction Score: 0.4845481933677843
- Mean Citation Score: 147.680422
- Max Citation Score: 167.91547
- Similarity Product: 134.84624657061815

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

Dataset: test