Managing data objects for graph-based data structures

Patent metadata

Field	Value
Publication number	US-2020320105-A1
Application number	US-202016830635-A
Country	US
Kind code	A1
Filing date	Mar 26, 2020
Priority date	Apr 3, 2019
Publication date	Oct 8, 2020
Grant date	—

Abstract

Various embodiments provide methods, systems, apparatus, computer program products, and/or the like for managing, ingesting, monitoring, updating, and/or extracting/retrieving information/data associated with an electronic record (ER) stored in an ER data store and/or accessing information/data from the ER data store, wherein the ERs are generated, updated/modified, and/or accessed via a graph-based domain ontology.

First claim

1 . A method for controlling access to data or functions a data storage system, the method comprising:
receiving, by a computing entity, a request indicating at least a function to be performed on an electronic record or an access requested to the electronic record, wherein (a) the request originates from a requesting entity identifiable by a requesting entity identifier, (b) the electronic record is associated with a subject entity identifiable by a subject entity identifier; responsive to receiving the request:
determining, by the computing entity, a relationship type between the requesting entity and the subject entity, wherein the relationship type is a direct relationship or an indirect relationship, and
determining, by the computing entity, a relationship status between the requesting entity and the subject entity, wherein the relationship type is (a) an active relationship, or (b) an inactive relationship;
response to determining that (a) the relationship type is a direct relationship, and the (b) the relationship status is an active relationship:
identifying, by the computing entity, a user role for the requesting entity with respect to the electronic record of the subject entity, and
identifying, by the computing entity, a rights group associated with the user role, wherein (a) the rights group comprises one or more rights stored in a rights group data object, (b) the one or more rights allow the function to be performed on the electronic record or the access requested to the electronic record, and (c) the rights data object comprises a corresponding key; and
enabling, by the computing entity, the function to be performed on the electronic record or the access requested to the electronic record based at least in part on the corresponding key.

2 . The method of claim 1 , wherein the requesting entity is represented as a node defined within a graph-based domain ontology that is identifiable by the requesting entity identifier, and (d) the subject entity is represented as a node defined within the graph-based domain ontology that is identifiable by the subject entity identifier.

3 . The method of claim 2 , wherein the relationship type is (a) a direct relationship in an instance in which the node representing the requesting entity is connected to the node representing the subject entity by one edge, and (b) an indirect relationship in an instance in which the node representing the requesting entity is connected to the node representing the subject entity by at least one intermediate node.

4 . The method of claim 3 , wherein the relationship type is determined by a preferred path between the node representing the requesting entity and the node representing the subject entity, wherein the preferred path comprises the least number of intermediate nodes.

5 . The method of claim 1 , wherein (a) the requesting entity is associated with a requesting entity relationship data object that is stored in a relationship table and that represents a relationship to the subject entity, (b) the requesting entity relationship data object is identifiable based at least in part on the requesting entity identifier, (c) the subject entity is associated with a subject entity relationship data object that is stored in the relationship table and that represents a relationship to the requesting entity, and (d) the subject entity relationship data object is identifiable based at least in part on the subject entity identifier.

6 . The method of claim 5 further comprising querying a database index for the relationship table for entity relationship data object and the subject entity relationship data object.

7 . The method of claim 5 , wherein the relationship type and the relationship status are determined based at least in part on the requesting entity relationship data object and the subject entity relationship data object.

8 . The method of claim 1 further comprising providing the corresponding key to a code module that enables the function to be performed on the electronic record or the access requested to the electronic record based at least in part on the corresponding key.

9 . The method of claim 1 , wherein the relationship status is associated with a future end date.

10 . The method of claim 1 , wherein (a) the user role corresponds to a class of data in the electronic record, and (b) the class of data is defined by a graph-based domain ontology.

11 . The method of claim 1 further comprising (a) generating an extractable packet data object, and (b) generating a data artifact packet data object based at least in part on the extractable packet data object, wherein the data artifact data object comprises (a) the subject 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.

12 . The method of claim 11 , wherein an extraction processing module:
automatically generates a container tree data structure comprising a data artifact container node as the 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, (b) each container node of plurality of container nodes comprises an observable and an empty value for the corresponding observable, (c) each empty value is to be retrieved from a database or aggregated from retrieved empty values; automatically traverses each of the plurality of container nodes of the container tree data structure in a depth-first traversal, wherein (a) at each container node that is a leaf node in the traversal, a method is executed to retrieve a non-empty value from the database for the corresponding observable, and (b) at the completion of the traversal, each of the plurality of container nodes comprises a non-empty value for the corresponding observable; after the depth-first traversal, automatically processes the container tree data structure to generate at least one observable group, wherein the at least one observable group comprises each observable and the corresponding non-empty value; and generates, based at least in part on the observable groups, an information message comprising the observable group for the function.

13 . The method of claim 12 , wherein automatically generating the container tree data structure comprises:
determining a type of container node that should contain an observable corresponding to an ontology concept identifier in the data artifact packet data object; determining whether a container node having the determined type is present in the container tree data structure; and responsive to determining that a container node having the determined type is present in the container tree data structure, storing the observable and a corresponding empty value in the container node, wherein (a) the depth-first traversal of the container tree data structure comprises aggregating two or more values of a sub container node to generate a value of container comprising the subcontainer, and (b) wherein the extractable packet data object is an XML document.

14 . A system comprising one or more processors, one or more memory storage areas comprising program code, the one or more memory storage areas and the program code configured to, with the one or more processors, cause the system to at least:
receive a request indicating at least a function to be performed on an electronic record or an access requested to the electronic record, wherein (a) the request originates f

Assignees

• Unitedhealth Group Inc

Inventors

• Korpman Ralph A
• Hilado Rudy R
• Clegg W Randal
• Post Cindy A

Classifications

• G06F40/30

  Semantic analysis · CPC title

• G06F40/295

  Named entity recognition · CPC title

• G06F40/205

  Parsing · CPC title

• G06F16/8373 Primary

  Query execution · CPC title

• G06F16/9024

  Graphs; Linked lists (G06F16/9027 takes precedence) · CPC title