# US 2021/0004388 A1 · System and method for merging slowly changing data

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2021/0004388 A1
- Document ID: US20210004388A1
- Status: Published application
- Kind: A1
- Application number: 17/027,044
- Filed: 2020-09-21
- Published: 2021-01-07
- Earliest claimed: 2017-12-29
- Assignees: IQVIA Inc.
- Applicants: IQVIA Inc.
- Inventors: Thomas Starr; Ivan Gudzei; Dave Musgrove; Katarzyna Jurkiewicz; Sergey Sinkevich; Vladimir Karaychentsev
- Web page: https://patentgrep.com/patent/US20210004388A1

## CPC

- G06F 16/258: {Data format conversion from or to a database}
- G06F 16/275: {Synchronous replication}
- G06F 16/119: {Details of migration of file systems (migration mechanisms in storage systems G06F3/0647)}
- G06F 16/23: Updating
- H04L 67/1097: for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
- G16H 70/00: ICT specially adapted for the handling or processing of medical references
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G16H: HEALTHCARE INFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR THE HANDLING OR PROCESSING OF MEDICAL OR HEALTHCARE DATA

## Abstract

The disclosure generally describes computer-implemented methods, software, and systems for accessing volumes of data records structured to include sets dimensions, each dimension labelled in a manner specific to respective entities; identifying candidates data records keyed by managed keys that span a subset of dimensions even though at least one dimension from the subset of dimensions is labelled differently between the different volumes; comparing the candidate data records from the different volumes to determine whether a particular managed key is valid based on contents of the candidate data records from the different volumes; in response to determining that the particular managed key is valid, combining the candidate data records keyed by the valid managed key to be merged and accessible as one continuous entry; and in response to determining that the particular managed key is invalid, combining the candidate data records from the different volumes as separate entries.

## Claims

### Claim 1

A computer-implemented method comprising:
identifying a plurality of candidate data records keyed by a plurality of managed keys,
wherein each of the plurality of managed keys spans a subset of dimensions included by a first volume of multiple data records and a second volume of multiple data records,
wherein at least one dimension from the subset of dimensions is labelled differently between the first volume and the second volume,
wherein the first volume of multiple data records are hosted on a first data server managed by a first entity,
wherein the first volume covers a first period and includes a first set of dimensions, each dimension being labelled specifically to the first entity,
wherein the second volume of multiple data records are hosted on a second data server managed by a second entity, and
wherein the second volume covers a second period and includes a second set of dimensions, each dimension being labelled specifically to the second entity,
determining that a managed key from the plurality of managed keys is invalid based on a comparison of the plurality of candidate data records from the first volume with the plurality of candidate data records from the second volume, wherein the plurality of candidate data records from the first volume and the plurality of candidate data records from the second volume both cover a period where the first period and the second period overlap; and
consolidating the first volume with the second volume by combining the plurality of candidate data records from the first volume with the plurality of candidate data records from the second volume according to the invalid managed key such that the plurality of candidate data records from the first volume and the plurality of candidate data records from the second volume keyed by the invalid managed key are combined and accessible as one continuous entry.

### Claim 2 (depends on 1)

The method of claim 1, wherein the comparison of the plurality of candidate data records from the first volume with the plurality of candidate data records from the second volume comprises:
comparing contents of the plurality of candidate data records from the first volume keyed by the managed key with the contents of the plurality of candidate data records from the second volume keyed by the managed key.

### Claim 3 (depends on 2)

The method of claim 2, wherein the plurality of candidate data records from the first volume and the plurality of candidate data records from the second volumes cover more than a threshold duration within the overlapping period.

### Claim 4 (depends on 2)

The method of claim 2, wherein the comparison of the plurality of candidate data records from the first volume with the plurality of candidate data records from the second volume utilizes a fuzzy logic.

### Claim 5 (depends on 4)

The method of claim 4, wherein the fuzzy logic comprises:
comparing contents of the plurality of candidate data records from the first volume with the contents of the plurality of candidate data records from the second volume to determine that the contents of the plurality of candidate data records from the first volume and the plurality of candidate data records from the second volume do not substantially match, wherein the at least one dimension is labelled differently.

### Claim 6 (depends on 5)

The method of claim 5, wherein the contents of the plurality of candidate data records from the first volume and the contents of the plurality of candidate data records from the second volume do not substantially match when the plurality of candidate data records from the first volume and the plurality of candidate data records from the second volume are identical for no more than a threshold percentage of a duration within the overlapping period.

### Claim 7 (depends on 5)

The method of claim 5, wherein the contents of the plurality of candidate data records from the first volume and the contents of the plurality of candidate data records from second volume do not substantially match when the plurality of candidate data records from the first volume and the plurality of candidate data records from the second volume are textually no more than a threshold percent identical.

### Claim 8 (depends on 5)

The method of claim 5, further comprising:
scoring a similarity between the contents of the plurality of candidate data records from the first volume with the contents of the plurality of the candidate data records from the second volume, wherein the contents of the plurality of candidate data records from the first volume and the contents of the plurality of candidate data records from the second volume do not substantially match when the scored similarity does not exceed a threshold value.

### Claim 9 (depends on 1)

The method of claim 1, wherein the subset of dimensions includes three or more dimensions.

### Claim 10

A computer system comprising one or more processors that are configured to perform operations of:
identifying a plurality of candidate data records keyed by a plurality of managed keys,
wherein each of the plurality of managed keys spans a subset of dimensions included by a first volume of multiple data records and a second volume of multiple data records,
wherein at least one dimension from the subset of dimensions is labelled differently between the first volume and the second volume,
wherein the first volume of multiple data records are hosted on a first data server managed by a first entity,
wherein the first volume covers a first period and includes a first set of dimensions, each dimension being labelled specifically to the first entity,
wherein the second volume of multiple data records are hosted on a second data server managed by a second entity, and
wherein the second volume covers a second period and includes a second set of dimensions, each dimension being labelled specifically to the second entity,
determining that a managed key from the plurality of managed keys is invalid based on a comparison of the plurality of candidate data records from the first volume with the plurality of candidate data records from the second volume, wherein the plurality of candidate data records from the first volume and the plurality of candidate data records from the second volume both cover a period where the first period and the second period overlap; and
consolidating the first volume with the second volume by combining the plurality of candidate data records from the first volume with the plurality of candidate data records from the second volume according to the invalid managed key such that the plurality of candidate data records from the first volume and the plurality of candidate data records from the second volume keyed by the invalid managed key are combined and accessible as one continuous entry.

### Claim 11 (depends on 10)

The computer system of claim 10, wherein the comparison of the plurality of candidate data records from the first volume with the plurality of candidate data records from the second volume comprises:
comparing contents of the plurality of candidate data records from the first volume keyed by the managed key with the contents of the plurality of candidate data records from the second volume keyed by the managed key.

### Claim 12 (depends on 11)

The computer system of claim 11, wherein the plurality of candidate data records from the first volume and the plurality of candidate data records from the second volumes cover more than a threshold duration within the overlapping period.

### Claim 13 (depends on 11)

The computer system of claim 11, wherein the comparison of the plurality of candidate data records from the first volume with the plurality of candidate data records from the second volume utilizes a fuzzy logic.

### Claim 14 (depends on 13)

The computer system of claim 13, wherein the fuzzy logic comprises:
comparing contents of the plurality of candidate data records from the first volume with the contents of the plurality of candidate data records from the second volume to determine that the contents of the plurality of candidate data records from the first volume and the plurality of candidate data records from the second volume do not substantially match, wherein the at least one dimension is labelled differently.

### Claim 15 (depends on 14)

The computer system of claim 14, wherein the contents of the plurality of candidate data records from the first volume and the contents of the plurality of candidate data records from the second volume do not substantially match when the plurality of candidate data records from the first volume and the plurality of candidate data records from the second volume are identical for no more than a threshold percentage of a duration within the overlapping period.

### Claim 16 (depends on 14)

The computer system of claim 14, wherein the contents of the plurality of candidate data records from the first volume and the contents of the plurality of candidate data records from second volume do not substantially match when the plurality of candidate data records from the first volume and the plurality of candidate data records from the second volume are textually no more than a threshold percent identical.

### Claim 17 (depends on 14)

The computer system of claim 14, wherein the operations further comprise:
scoring a similarity between the contents of the plurality of candidate data records from the first volume with the contents of the plurality of the candidate data records from the second volume, wherein the contents of the plurality of candidate data records from the first volume and the contents of the plurality of candidate data records from the second volume do not substantially match when the scored similarity does not exceed a threshold value.

### Claim 18 (depends on 10)

The computer system of claim 10, wherein the subset of dimensions includes three or more dimensions.
