IP Library › Granted Patent US 11,669,571
Granted Patent B2
US 11,669,571 · App. 17/204,735 · Granted Jun 6, 2023

Predicted data use obligation match using data differentiators

Inventors: Daniel L. Binkley (Weatogue, CT); Lisa A. Hodne (Buffalo, MN); Matthew Jon Hartzler (Mound, MN); Majdoddin Izadian (West Linn, OR)
Assignee: OPTUM, INC.
G06F16/9024G06F16/2272G06F16/2457G06F16/904G06F16/9035G06F16/9038
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,669,571
App. No.
17/204,735
Filed
Mar 17, 2021
Granted
Jun 6, 2023
Kind
B2
Examiner
KIM, TAELOR
Art Unit
2156
USPC
707/798
Abstract

Embodiments provide for predicted data use obligation matching using data differentiators. Example embodiments retrieve a cross-link relationship graph structure from a data repository, where the cross-link relationship graph structure includes a plurality of cross-link relationship graph nodes connected by a plurality of cross-link relationship graph edges. Each cross-link relationship graph node is associated with a unique logical data record set identifier of a plurality of logical data record set identifiers associated with a dataset identifier. For each unique logical data record set identifier, the cross-link relationship graph structure is traversed. Based at least in part on a separation measure associated with each cross-link relationship of one or more cross-link relationships associated with the unique logical data record set identifier, one or more data use obligation scores for the unique logical data record set identifier is generated.

Claims (36)

1. An apparatus comprising at least one processor and at least one memory including program code that with the processor, cause the apparatus to:

receive an intended use request, wherein the intended use request comprises (a) a plurality of unique logical data record set identifiers and (b) an intended use identifier;

receive a cross-link relationship graph structure, wherein (a) the cross-link relationship graph structure comprises a plurality of cross-link relationship graph nodes, and (b) each cross-link relationship graph node of the cross-link relationship graph nodes is connected to at least one of a plurality of cross-link relationship graph edges, and (c) associated with a respective logical data record set identifier of the unique logical data record set identifiers associated with the intended use request; and

for each unique logical data record set identifier,

traverse the cross-link relationship graph structure; and

based at least in part on (i) the intended use identifier, (ii) a separation measure associated with each cross-link relationship graph node of one or more cross-link relationship graph nodes associated with the unique logical data record set identifier, and (iii) time associated with each cross-link relationship graph node, generate one or more data use obligation scores for the unique logical data record set identifier, wherein (a) each data use obligation score represents a likelihood that a data use obligation associated with the given cross-link relationship graph node is associated with the unique logical data record set identifier, and (b) the data use obligation comprises one or more data use restrictions that apply to one or more data record identifiers associated with the unique logical data record set identifier.

2. The apparatus of claim 1 , wherein each data use restriction comprises instructions that define control of access to or use of the data record identifiers.

3. The apparatus of claim 1 , wherein the separation measure is based at least in part on a degree of separation between a pair of cross-link relationship graph nodes of the cross-link relationship graph nodes associated with the unique logical data record set identifier.

4. The apparatus of claim 3 , wherein the degree of separation is associated with a number of cross-link relationship graph edges that exist between the pair of cross-link relationship graph nodes.

5. The apparatus of claim 1 , wherein a first cross-link relationship graph node of the cross-link relationship graph nodes associated with the unique logical data record set identifier is connected to at least a second cross-link relationship graph node of the cross-link relationship graph nodes associated with the unique logical data record set identifier by way of at least a first cross-link relationship graph edge of the cross-link relationship graph edges.

6. The apparatus of claim 5 , wherein a strength measure is associated with the first cross-link relationship graph edge associated with the first cross-link relationship graph node and the second cross-link relationship graph node.

7. The apparatus of claim 1 , wherein a logical data record set associated with a unique logical data record set identifier comprises a plurality of columns and a plurality of rows.

8. The apparatus of claim 7 , wherein the logical data record set further comprises one or more of one or more row differentiators or one or more column differentiators.

9. The apparatus of claim 8 , wherein a row differentiator of the row differentiators represents the data use obligation for data included in a row of the rows, and wherein the data use obligation is based at least in part on one or more data use obligation policies.

10. The apparatus of claim 8 , wherein a column differentiator of the column differentiators represents the data use obligation for data in a column of the columns, and wherein the data use obligation is based at least in part on one or more data use obligation policies.

11. A computer-implemented method, comprising:

receiving an intended use request, wherein the intended use request comprises (a) a plurality of unique logical data record set identifiers and (b) an intended use identifier;

receiving a cross-link relationship graph structure stored in a data repository, wherein (a) the cross-link relationship graph structure comprises a plurality of cross-link relationship graph nodes, (b) each cross-link relationship graph node is connected to at least one of a plurality of cross-link relationship graph edges, and (c) each cross-link relationship graph node is associated with a respective logical data record set identifier of the unique logical data record set identifiers associated with the intended use request; and

for each unique logical data record set identifier,

traversing the cross-link relationship graph structure; and

based at least in part on (i) the intended use identifier, (ii) a separation measure associated with each cross-link relationship graph node of one or more cross-link relationship graph nodes associated with the unique logical data record set identifier, and (iii) time associated with each cross-link relationship graph node, generate one or more data use obligation scores for the unique logical data record set identifier, wherein (a) each data use obligation score represents a likelihood that a data use obligation associated with a given cross-link relationship graph node is associated with the unique logical data record set identifier, and (b) the data use obligation comprises one or more data use restrictions that apply to one or more data record identifiers associated with the unique logical data record set identifier.

12. The method of claim 11 , wherein a data use restriction comprises instructions that define control of access to or use of the one or more data record identifiers.

13. The method of claim 11 , wherein the separation measure is based at least in part on a degree of separation between any two given cross-link relationship graph nodes.

14. The method of claim 13 , wherein the degree of separation is associated with a number of cross-link relationship graph edges that exist between the two given cross-link relationship graph nodes.

15. The method of claim 11 , wherein a first cross-link relationship graph node is connected to at least a second cross-link relationship graph node by way of at least a first cross-link relationship graph edge.

16. The method of claim 15 , wherein a strength measure is associated with the first cross-link relationship associated with the first cross-link relationship graph node and the second cross-link relationship graph node.

17. The method of claim 11 , wherein a logical data record set associated with a unique logical data record set identifier comprises a plurality of columns and a plurality of rows.

18. The method of claim 17 , wherein a logical data record set further comprises one or more of one or more row differentiators or one or more column differentiators.

19. The method of claim 18 , wherein a row differentiator represents a first data use obligation for data included in a given row of the plurality of rows, and wherein the first data use obligation is based at least in part on one or more first data use obligation policies.

20. The method of claim 18 , wherein a column differentiator represents a second data use obligation for data in a given column of the plurality of columns, and wherein the second data use obligation is based at least in part on one or more second data use obligation policies.

21. A computer program product comprising at least one non-transitory computer readable storage medium comprising computer code that, when executed by an apparatus, configure the apparatus to:

receive an intended use request, wherein the intended use request comprises (a) a plurality of unique logical data record set identifiers and (b) an intended use identifier;

receive a cross-link relationship graph structure from a data repository, wherein (a) the cross-link relationship graph structure comprises a plurality of cross-link relationship graph nodes, (b) each cross-link relationship graph node is connected to at least one of a plurality of cross-link relationship graph edges, and (c) each cross-link relationship graph node is associated with a respective logical data record set identifier of the unique logical data record set identifiers associated with the intended use request; and

for each unique logical data record set identifier,

traverse the cross-link relationship graph structure; and

based at least in part on (i) the intended use identifier, (ii) a separation measure associated with each cross-link relationship graph node of one or more cross-link relationship graph nodes associated with the unique logical data record set identifier, and (iii) time associated with each cross-link relationship graph node, generate one or more data use obligation scores for the unique logical data record set identifier, wherein (a) each data use obligation score represents a likelihood that a data use obligation associated with a given cross-link relationship graph node is associated with the unique logical data record set identifier, and (b) the data use obligation comprises one or more data use restrictions that apply to one or more data record identifiers associated with the unique logical data record set identifier.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 26, 2022
From: BINKLEY, DANIEL L.; HODNE, LISA A.; HARTZLER, MATTHEW JON; IZADIAN, MAJDODDIN
To: OPTUM, INC.
Reel/Frame 058775/0738 →
Continuity (2)
Provisional Application 62990510 · Mar 17, 2020
Related Publication 20210294853A1 · Sep 23, 2021
Cited By (107)
US 12,206,696 US 12,244,621 US 12,261,866 US 12,267,345 US 12,284,197 US 12,309,181 US 12,309,182 US 12,309,185 US 12,309,236 US 12,323,449 US 12,335,286 US 12,335,348 US 12,341,797 US 12,348,545 US 12,355,626 US 12,355,787 US 12,355,793 US 12,363,148 US 12,368,745 US 12,368,746 US 12,368,747 US 12,375,573 US 12,381,901 US 12,395,573 US 12,401,669 US 12,405,849 US 12,407,701 US 12,407,702 US 12,418,552 US 12,418,555 US 12,425,428 US 12,425,430 US 12,445,474 US 12,452,272 US 12,452,279 US 12,457,231 US 12,463,994 US 12,463,995 US 12,463,996 US 12,463,997 US 12,464,003 US 12,470,577 US 12,470,578 US 12,483,576 US 12,489,770 US 12,489,771 US 12,495,052 US 12,500,910 US 12,500,911 US 12,500,912 US 12,505,126 US 12,506,762 US 12,511,110 US 12,513,221 US 12,526,297 US 12,537,836 US 12,537,837 US 12,537,839 US 12,537,840 US 12,537,884 US 12,549,575 US 12,549,577 US 12,556,548 US 12,556,559 US 12,563,060 US 12,563,064 US 12,563,071 US 12,563,072 US 12,580,932 US 12,580,934 US 12,580,935 US 12,580,936 US 12,580,937 US 12,587,553 US 12,592,950 US 12,598,205 US 12,613,930 US 12,615,271 US 12,621,324 US 12,621,329 US 12,627,686 US 12,627,687 US 12,627,690 US 12,634,312 US 12,634,376 US 12,652,302 US 12,659,325 US 12,659,326 US 12,659,327 US 12,659,333 US 12,676,874 US 12,689,638 US 12,689,640 US 12,695,768 US 12,706,931 US 12,706,932 US 12,706,933 US 12,706,980 US 12,712,897 US 12,719,896 US 12,726,495 US 12,730,899 US 12,739,266 US 12,739,267 US 12,744,799 US 12,744,800 US 12,744,802