US 11,144,512 B2Granted

Data intersection mastering in hierarchical systems

AssigneeOracle International Corporation

InventorsMatthew Lawrence Lontchar, Douglas R. Cosby, Anurag Garg, Rahul R. Kamath, Narayan Madhavan Nayar

Life of this patent

Estimating the term…

Loading patent…

Abstract

Various techniques are disclosed herein for storing and managing master data in hierarchical data systems. Several related concepts, embodiments, and examples are disclosed, including techniques for incremental rationalization in a hierarchical data model, techniques for implementing governance pools in a hierarchical data model, techniques for application materialization in a hierarchical data model, techniques for data intersection mastering in a hierarchical data model, techniques for change request visualization in a hierarchical data model, and techniques for hierarchy preparation in a hierarchical data model.

Claims20

Dependent claims

A method comprising:

receiving, by a computer system via a first application, a request to access one or more intersection data nodes within a first data dimension associated with the first application, wherein the first data dimension associated with the first application comprises a plurality of intersection data nodes, each of the intersection data nodes of the first data dimension having a node type, and wherein an intersection data node includes a combination of values from multiple node types;
determining, by the computer system, that the first data dimension associated with the first application corresponds to a shared master data dimension within a hierarchical master data store;
accessing, by the computer system, the shared master data dimension via a hierarchy management server, in response to the request;
determining, by the computer system, one or more authorization permissions associated with the first application, wherein the one or more authorization permissions designate whether the first application is required to use a set of mastered intersection data nodes or allowed to use a customized set of intersection data nodes;
determining, by the computer system, that the first application is required to use the set of mastered intersection data nodes;
retrieving, by the computer system and via the hierarchy management server, the requested intersection data nodes from the shared master data dimension within the hierarchical master data store, wherein the retrieved intersection data nodes are from the set of mastered intersection data nodes, wherein each particular intersection data node retrieved from the shared master data dimension within the hierarchical master data store comprises:
(a) a plurality of constituent data nodes having different node types, wherein each constituent data node has a data node value and a set of properties, wherein each intersection data node inherits the set of properties from its plurality of constituent data nodes;
and
(b) an additional set of properties associated with the particular intersection data node, wherein the additional set of properties represents characteristics of the particular intersection data node itself, and wherein the additional set of properties are not derived from the properties of the constituent data nodes;
and
providing, by the computer system, the requested intersection data nodes to the first application.

8 more elements

A system comprising:

a processing unit comprising one or more processors;
and
memory coupled with and readable by the processing unit and storing therein a set of instructions which, when executed by the processing unit, causes the system to:
receive, by a computer system via a first application, a request to access one or more intersection data nodes within a first data dimension associated with the first application, wherein the first data dimension associated with the first application comprises a plurality of intersection data nodes, each of the intersection data nodes of the first data dimension having a node type, and wherein an intersection data node includes a combination of values from multiple node types;
determine, by the computer system, that the first data dimension associated with the first application corresponds to a shared master data dimension within a hierarchical master data store;
access, by the computer system, the shared master data dimension via a hierarchy management server, in response to the request;
determine, by the computer system, one or more authorization permissions associated with the first application, wherein the one or more authorization permissions designate whether the first application is required to use a set of mastered intersection data nodes or allowed to use a customized set of intersection data nodes;
determine, by the computer system, that the first application is required to use the set of mastered intersection data nodes;
retrieve, by the computer system and via the hierarchy management server, the requested intersection data nodes from the shared master data dimension within the hierarchical master data store, wherein the retrieved intersection data nodes are from the set of mastered intersection data nodes, wherein each particular intersection data node retrieved from the shared master data dimension within the hierarchical master data store comprises:
(a) a plurality of constituent data nodes having different node types, wherein each constituent data node has a data node value and a set of properties, wherein each intersection data node inherits the set of properties from its plurality of constituent data nodes;
and
(b) an additional set of properties associated with the particular intersection data node, wherein the additional set of properties represents characteristics of the particular intersection data node itself, and wherein the additional set of properties are not derived from the properties of the constituent data nodes;
and
provide, by the computer system, the requested intersection data nodes to the first application.

11 more elements

A computer-program product tangibly embodied in a non-transitory machine-readable storage medium, including instructions configured to cause one or more data processors to perform actions comprising:

receiving, by a computer system via a first application, a request to access one or more intersection data nodes within a first data dimension associated with the first application, wherein the first data dimension associated with the first application comprises a plurality of intersection data nodes, each of the intersection data nodes of the first data dimension having a node type, and wherein an intersection data node includes a combination of values from multiple node types;
determining, by the computer system, that the first data dimension associated with the first application corresponds to a shared master data dimension within a hierarchical master data store;
accessing, by the computer system, the shared master data dimension via a hierarchy management server, in response to the request;
determining, by the computer system, one or more authorization permissions associated with the first application, wherein the one or more authorization permissions designate whether the first application is required to use a set of mastered intersection data nodes or allowed to use a customized set of intersection data nodes;
determining, by the computer system, that the first application is required to use the set of mastered intersection data nodes;
retrieving, by the computer system and via the hierarchy management server, the requested intersection data nodes from the shared master data dimension within the hierarchical master data store, wherein the retrieved intersection data nodes are from the set of mastered intersection data nodes, wherein each particular intersection data node retrieved from the shared master data dimension within the hierarchical master data store comprises:
(a) a plurality of constituent data nodes having different node types, wherein each constituent data node has a data node value and a set of properties, wherein each intersection data node inherits the set of properties from its plurality of constituent data nodes;
and
(b) an additional set of properties associated with the particular intersection data node, wherein the additional set of properties represents characteristics of the particular intersection data node itself, and wherein the additional set of properties are not derived from the properties of the constituent data nodes;
and
providing, by the computer system, the requested intersection data nodes to the first application.

8 more elements

Dependencies are inferred from the claim text.

Facts

Application: 15/648,197Filed 12 Jul 2017 · us provisional application
Priority: 17 Sep 2016
Published: US 2018/0081879 A122 Mar 2018
Granted: 12 Oct 2021
Term ends: Not estimatedThe source records don’t support an estimate.

Classification8 codes

G06F 16/185
File system types: hierarchical storage management [HSM] systems, e.g. file migration or policies thereof
G06Q 10/06316
Resource planning, allocation, distributing or scheduling for enterprises or organisations: sequencing of tasks or work
G06F 16/23
Of structured data, e.g. relational data: updating
G06F 16/248
Querying: presentation of query results