Granted Patent B2

US 12,265,509 · App. 18/186,642 · Granted Apr 1, 2025

Inventors: William H. Bishop (Raleigh, NC); Christopher A. Connor (Youngsville, NC); Sloan H. Holliday (Apex, NC)

Assignee: Optum, Inc.

G06F16/185G06F16/172

Abstract

Claims (97)

1. A computing system comprising:

a memory configured to store a data file comprising a plurality of rows each including a first column and a second column, wherein:

for each row of the plurality of rows, the first column of the row contains a first-level resource identifier (ID), of a plurality of first-level resource IDs, that identifies a respective first-level resource, of a plurality of first-level resources, and the second column contains a data element, of a plurality of data elements, that provides information regarding the respective first-level resource; and

one or more processors communicatively coupled to the memory, the one or more processors configured to:

initiate one or more threads assigned to one or more unique first-level resource IDs of the plurality of first-level resource IDs; and

for each respective unique first-level resource ID of the one or more unique first-level resource IDs:

identify a first row set that comprises one or more of the plurality of rows that contain the respective unique first-level resource ID; and

for at least a first row of the first row set:

determine whether a first data element in the second column of the first row is different from a second data element in the second column of a predecessor row from the first row set that precedes the first row;

in response to determining that the first data element is different from the second data element, enqueue the first row in a first queue for a first thread, from the one or more threads, assigned to the respective unique first-level resource ID;

dequeue the first row from the first queue for the first thread; and

cause a server to create a second-level resource that stores a version of the first data element.

2. The computing system of claim 1 , wherein the one or more processors cause the server to create the second-level resource by sending a request to the server, causing the server to create, in a hierarchical data store, the second-level resource.

3. The computing system of claim 1 , wherein the one or more processors are further configured to send a request causing the server to create, in a hierarchical data store, relationship data for the second-level resource that specify that the second-level resource is a parent of a relevant first-level resource for the second-level resource, wherein the relevant first-level resource for the second-level resource is identified by a first-level resource ID, of the plurality of first-level resource IDs, contained in the first column of the first row.

4. The computing system of claim 3 , wherein:

the first thread is configured to:

obtain a first logical ID of the relevant first-level resource for the second-level resource and a first version ID of the relevant first-level resource for the second-level resource; and

obtain, from the server, a second logical ID of the second-level resource and a second version ID of the second-level resource, and

wherein the relationship data for the second-level resource specifies that the second-level resource is the parent of the relevant first-level resource for the second-level resource by specifying: (1) the second logical ID and the second version ID and (2) the first logical ID and the first version ID.

5. The computing system of claim 4 , wherein:

the second-level resource is a first second-level resource,

the first thread is further configured to store a row number of the first row, the second logical ID, and the second version ID in a cache,

each of the plurality of rows further includes a third column that contains a third-level resource ID that identifies a third-level resource,

a set of unique third-level resource IDs is defined as including only unique third-level resource IDs contained in the third column of the plurality of rows,

for each respective third-level resource ID in the set of unique third-level resource IDs, the one or more threads include a second thread assigned to the respective third-level resource ID, and

the one or more processors are further configured to:

identify a second row set for the respective third-level resource ID that comprises ones of the plurality of rows that contain the respective third-level resource ID;

for at least a second row of the second row set:

determine whether a third data contained in any subordinate column of the second row is different from a fourth data element contained in a corresponding subordinate column of a predecessor row for the second row, wherein the predecessor row for the second row precedes the second row in the second row set;

in response to determining that the third data element is different from the fourth data element, enqueue the second row in a second queue for the second thread, and

wherein the second thread is configured to, for each third row enqueued in the second queue:

dequeue the third row from the second queue;

use a row number of the third row to search the cache to obtain a third logical ID of a second-level resource and a third version ID of the second second-level resource;

send a request causing the server to create, in the hierarchical data store, a third-level resource that specifies the third-level resource ID contained in the third column of the third row;

obtain, from the server, a fourth logical ID and a fourth version ID of the third-level resource; and

send a request causing the server to create, in the hierarchical data store, relationship data for the third-level resource that specify that the third-level resource is a parent of the second second-level resource by specifying the fourth logical ID and the fourth version ID and the third logical ID and the third version ID.

6. The computing system of claim 5 , wherein, for a fourth row of the second row set, the one or more processors are further configured to, in response to determining that a fifth data element in the second column of the fourth row is not different from a sixth data element in the second column of the fourth row:

obtain a fifth logical ID of a predecessor second-level resource and a fifth version ID of the predecessor second-level resource, the predecessor second-level resource being a second-level resource created for the predecessor row for the fourth row of the second row set; and

store a row number of the fourth row of the second row set, the fifth logical ID, and the fifth version ID in the cache.

7. The computing system of claim 1 , wherein two or more of the threads that are assigned to the unique first-level resource IDs operate in parallel.

8. The computing system of claim 1 , wherein the server is a Fast Healthcare Interoperability Resources (FHIR) server.

9. The computing system of claim 1 , wherein:

the plurality of first-level resource IDs includes a patient identifier, and the plurality of data elements provides information regarding one or more of patient first name, patient last name, patient address, or patient birth date, or

the plurality of first-level resource IDs includes a provider ID, and the plurality of data elements provides information regarding one or more of a provider name, or provider address.

10. A computer-implemented method comprising:

obtaining, by one or more processors, a data file comprising a plurality of rows each including a first column and a second column, wherein:

for each row of the plurality of rows, the first column of the row contains a first-level resource identifier (ID), of a plurality of first-level resource IDs, that identifies a respective first-level resource, of a plurality of first-level resources, and the second column contains a data element, of a plurality of data elements, that provides information regarding the respective first-level resource;

initiating, by the one or more processors, one or more threads assigned to one or more unique first-level resource IDs of the plurality of first-level resource IDs; and

for each respective unique first-level resource ID of the one or more unique first-level resource IDs:

identifying, by the one or more processors, a first row set that comprises one or more of the plurality of rows that contain the respective unique first-level resource ID; and

for at least a first row of the first row set:

determining, by the one or more processors, whether a first data element in the second column of the first row is different from a second data element in the second column of a predecessor row from the first row set that precedes the first row;

in response to determining that the first data element is different from the data second element, enqueuing, by the one or more processors, the first row in a first queue for a first thread, from the one or more threads, assigned to the respective unique first-level resource ID;

dequeue the first row from the first queue for the first thread; and

cause a server to create a second-level resource that stores a version of the first data element.

11. The computer-implemented method of claim 10 , wherein the first thread is configured to, as part of causing the server to create the second-level resource, send a request to the server, causing the server to create, in a hierarchical data store, the second-level resource.

12. The computer-implemented method of claim 10 , wherein the first thread is configured to create, in a hierarchical data store, relationship data for the second-level resource that specify that the second-level resource is a parent of a relevant first-level resource for the second-level resource, wherein the relevant first-level resource for the second-level resource is identified by a first-level resource ID, of the plurality of first-level resource IDs, contained in the first column of the first row.

13. The computer-implemented method of claim 12 , wherein:

the first thread is further configured to:

obtain a first logical ID of the relevant first-level resource for the second-level resource and a first version ID of the relevant first-level resource for the second-level resource; and

obtain, from the server, a second logical ID of the second-level resource and a second version ID of the second-level resource, and

wherein the relationship data for the second-level resource specifies that the second-level resource is the parent of the relevant first-level resource for the second-level resource by specifying: (1) the second logical ID and the second version ID and (2) the first logical ID and the first version ID.

14. The computer-implemented method of claim 13 , wherein:

the second-level resource is a first second-level resource,

the first thread is further configured to store a row number of the first row, the second logical ID, and the second version ID in a cache,

each of the plurality of rows further includes a third column that contains a third-level resource ID that identifies a third-level resource,

a set of unique third-level resource IDs is defined as including only unique third-level resource IDs contained in the third column of the plurality of rows,

for each respective third-level resource ID in the set of unique third-level resource IDs, the one or more threads include a second thread assigned to the respective third-level resource ID, and

the computer-implemented method further comprises:

identifying, by the one or more processors, a second row set for the respective third-level resource ID that comprises ones of the plurality of rows that contain the respective third-level resource ID;

for at least a second row of the second row set:

determining, by the one or more processors, whether a third data element contained in any subordinate column of the second row is different from a fourth data element contained in a corresponding subordinate column of a predecessor row for the second row, wherein the predecessor row for the second row precedes the second row in the second row set;

in response to determining that the third data element is different from the fourth data element, enqueuing the second row in a second queue for the second thread, and

wherein the second thread is configured to, for each third row enqueued in the second queue dequeue the third row from the second queue;

use a row number of the third row to search the cache to obtain a third logical ID of a second second-level resource and a third version ID of the second second-level resource;

send a request causing the server to create, in the hierarchical data store, a third-level resource that specifies the third-level resource ID contained in the third column of the third row;

obtain, from the server, a fourth logical ID and a fourth version ID of the third-level resource; and

send a request causing the server to create, in the hierarchical data store, relationship data for the third-level resource that specify that the third-level resource is a parent of the second second-level resource by specifying the fourth logical ID and the fourth version ID and the third logical ID and the third version ID.

15. The computer-implemented method of claim 14 , further comprising, for a fourth row of the second row set, in response to determining that a fifth data element in the second column of the fourth row is not different from a sixth data element in the second column of the fourth row:

obtaining, by the one or more processors, a fifth logical ID of a predecessor second-level resource and a fifth version ID of the predecessor second-level resource, the predecessor second-level resource being a second-level resource created for the predecessor row for the fourth row of the second row set; and

storing, by the one or more processors, a row number of the fourth row of the second row set, the fifth logical ID, and the fifth version ID in the cache.

16. The computer-implemented method of claim 10 , wherein two or more of the threads that are assigned to the unique first-level resource IDs operate in parallel.

17. The computer-implemented method of claim 10 , wherein the server is a Fast Healthcare Interoperability Resources (FHIR) server.

18. The computer-implemented method of claim 10 , wherein:

the plurality of first-level resource IDs include a patient identifier, and the plurality of data elements provides information regarding one or more of patient first name, patient last name, patient address, or patient birth date, or

the plurality of first-level resource IDs includes a provider ID, and the plurality of data elements provides information regarding one or more of a provider name, or provider address.

19. One or more non-transitory computer readable storage media comprising instructions stored thereon that, when executed by one or more processors, cause the one or more processors to:

obtain a data file comprising a plurality of rows each including a first column and a second column, wherein:

for each row of the plurality of rows, the first column of the row contains a first-level resource identifier (ID), of a plurality of first-level resource IDs, that identifies a respective first-level resource, of a plurality of first-level resources, and the second column contains a data element, of a plurality of data elements, that provides information regarding the respective first-level resource;

initiate one or more threads assigned to one or more unique first-level resource IDs of the plurality of first-level resource IDs; and

for each respective unique first-level resource ID of the one or more unique first-level resource IDs:

identify a first row set that comprises one or more of the plurality of rows that contain the respective unique first-level resource ID; and

for at least a first row of the first row set:

determine whether a first data element in the second column of the first row is different from a second data element in the second column of a predecessor row from the first row set that precedes the first row;

in response to determining that the first data element is different from the second data element, enqueue the first row in a first queue for a first thread, from the one or more threads, assigned to the respective unique first-level resource ID;

dequeue the first row from the first queue for the first thread; and

cause a server to create a second-level resource that stores a version of the first data element.

Assignments (1)

Continuity (1)

References Cited (26)