PATENT CLAIM ANALYSIS

Application Number: 15977692
Application Type: Utility
Filing Date: 2018-05
Publication Date: 2018-09
Patent Classification: ["707", "747000"]

Abstract:
Aspects described herein relate to methods and systems for comparing data stored in disparate parallel systems using hash sums. A database having a parallel system architecture may comprise a plurality of nodes each storing a plurality of records. A central node may initiate parallel calculation of a set of node hash sums for each individual node. Calculating a node hash sum for an individual node may comprise calculating, by the individual node, a set of hash values for each individual record of the plurality of records stored by the individual node and combining each hash value of the set of hash values to generate the node hash sum for the individual node. The central processor may combine each node hash sum to generate a database hash sum. The central processor may store the generated database hash sum and/or utilize it in comparisons with database hash sums for other databases.

Claim (Index 16):
A database management system comprising:\n a first database having a first parallel system architecture; a second database having a second parallel system architecture different from the first parallel system architecture; at least one processor; and memory storing computer readable instructions that, when executed by the at least one processor, cause the database management system to compare first content of the first database with second content of the second database by causing the database management system to:\n cause calculation of a first database hash sum for the first database, wherein the first database hash sum is calculated by parallel processing on a first plurality of nodes of the first database using a first aggregation function; \n cause calculation of a second database hash sum for the first database, wherein the second database hash sum is calculated by parallel processing on the first plurality of nodes using a second aggregation function different from the first aggregation function; \n cause calculation of a third database hash sum for the second database, wherein the third database hash sum is calculated by parallel processing on a second plurality of nodes of the second database using the first aggregation function; \n cause calculation of a fourth database hash sum for the second database, wherein the second database hash sum is calculated by parallel processing on the second plurality of nodes using the second aggregation function; \n compare the first database hash sum with the third database hash sum and the second database hash sum with the fourth database hash sum; and \n determine whether the first content of the first database is equivalent to the second content of the second database based on a result of the comparison.

Metadata:
- Claim Count in Document: 50.0
- Percentile: 93.0
- Lexical Diversity: 2.49206
- Patent Class: 707.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['14750133', '10666729', '14629107', '14555013', '15950013']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.2009699363118327
- 35 USC 102 Novelty (BERT): 0.5474322051582446
- Combined Prediction Score: 0.2356161631964739
- Mean Citation Score: 222.673318
- Max Citation Score: 426.82938
- Similarity Product: 333.5238012488008

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

Dataset: test