US 11,741,085 B2
Managing data objects for graph-based data structures
Ralph A. Korpman, Nashville, TN (US); Rudy R. Hilado, Leesburg, VA (US); W. Randal Clegg, Yucaipa, CA (US); and Cindy A. Post, Colton, CA (US)
Assigned to UnitedHealth Group Incorporated, Minnetonka, MN (US)
Filed by UnitedHealth Group Incorporated, Minnetonka, MN (US)
Filed on Dec. 22, 2021, as Appl. No. 17/558,653.
Application 17/558,653 is a continuation of application No. 16/830,578, filed on Mar. 26, 2020, granted, now 11,281,662.
Claims priority of provisional application 62/874,638, filed on Jul. 16, 2019.
Claims priority of provisional application 62/873,217, filed on Jul. 12, 2019.
Claims priority of provisional application 62/860,047, filed on Jun. 11, 2019.
Claims priority of provisional application 62/860,031, filed on Jun. 11, 2019.
Claims priority of provisional application 62/860,050, filed on Jun. 11, 2019.
Claims priority of provisional application 62/845,089, filed on May 8, 2019.
Claims priority of provisional application 62/845,109, filed on May 8, 2019.
Claims priority of provisional application 62/845,085, filed on May 8, 2019.
Claims priority of provisional application 62/845,084, filed on May 8, 2019.
Claims priority of provisional application 62/828,517, filed on Apr. 3, 2019.
Claims priority of provisional application 62/828,526, filed on Apr. 3, 2019.
Prior Publication US 2022/0121651 A1, Apr. 21, 2022
This patent is subject to a terminal disclaimer.
Int. Cl. G06F 16/23 (2019.01); G06F 40/30 (2020.01); G06F 16/901 (2019.01); G06F 16/245 (2019.01); G06F 16/242 (2019.01); G06F 16/28 (2019.01); G06F 16/903 (2019.01); G06F 9/54 (2006.01); G06F 16/958 (2019.01); G06F 40/205 (2020.01); G06F 40/295 (2020.01); G06F 21/31 (2013.01); G06F 16/81 (2019.01); G06F 16/36 (2019.01); G06F 16/957 (2019.01)
CPC G06F 16/2379 (2019.01) [G06F 9/54 (2013.01); G06F 9/541 (2013.01); G06F 16/23 (2019.01); G06F 16/2358 (2019.01); G06F 16/244 (2019.01); G06F 16/245 (2019.01); G06F 16/288 (2019.01); G06F 16/367 (2019.01); G06F 16/81 (2019.01); G06F 16/9024 (2019.01); G06F 16/9027 (2019.01); G06F 16/90335 (2019.01); G06F 16/9577 (2019.01); G06F 16/986 (2019.01); G06F 21/31 (2013.01); G06F 40/205 (2020.01); G06F 40/295 (2020.01); G06F 40/30 (2020.01)] 24 Claims
OG exemplary drawing
 
1. A method for extracting information from a data store, the method comprising:
receiving, by one or more processors, a data artifact packet data object that comprises (a) an entity identifier identifying a subject entity, and (b) one or more ontology concept identifiers corresponding respectively to one or more concepts defined within a graph-based domain ontology, wherein the graph-based domain ontology comprises a specific set or hierarchy of concepts and relationships among the one or more concepts;
generating, by the one or more processors, a container tree data structure comprising a data artifact container node as a root node based at least in part on the data artifact packet data object, wherein (a) the container tree data structure comprises a plurality of container nodes that are descendants of the root node based at least in part on the data artifact packet data object, and (b) each container node of the plurality of container nodes comprises an observable and an empty value for the corresponding observable;
traversing, by the one or more processors, each of the plurality of container nodes of the container tree data structure to retrieve a non-empty value from the data store for the corresponding observable;
after the traversing, processing, by the one or more processors, the container tree data structure to generate at least one observable group comprising the observable of each of the plurality of container nodes and the corresponding non-empty value; and
generating, by the one or more processors and based at least in part on the at least one observable group, an information message comprising the at least one observable group.