# US 2021/0173870 A1 · Methods and systems for multidimensional analysis of interconnected data sets stored in a graph database

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2021/0173870 A1
- Document ID: US20210173870A1
- Status: Published application
- Kind: A1
- Application number: 17/122,846
- Filed: 2020-12-15
- Published: 2021-06-10
- Earliest claimed: 2015-03-05
- Assignees: Workday, Inc.
- Applicants: Workday, Inc.
- Inventors: Matthew Shore; Huned Botee; Joe Kuo; Suresh Balasubramhanya
- Web page: https://patentgrep.com/patent/US20210173870A1

## CPC

- G06F 16/9024: {Graphs; Linked lists (G06F16/9027 takes precedence)}
- G06F 16/283: {Multi-dimensional databases or data warehouses, e.g. MOLAP or ROLAP}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Multidimensional databases are well-suited for viewing data at different levels of detail. Graph databases are well-suited for modeling data sets with complex relationships. A novel platform for analysis and planning is enabled by linking multidimensional and graph databases. Graphs are data structures stored in graph databases. Graphs use nodes and edges to model data elements, some of which are derived. A graph is traversed to derive new data. elements. To perform analysis on the graph data elements, graph traversal paths are stored as tuples in a fact table. This fact table is in turn loaded into the multidimensional database by mapping the fact table's attribute columns to dimensions of the multidimensional database.

## Claims

### Claim 1

(canceled)

### Claim 2

(canceled)

### Claim 3

(canceled)

### Claim 4

(canceled)

### Claim 5

(canceled)

### Claim 6

(canceled)

### Claim 7

(canceled)

### Claim 8

(canceled)

### Claim 9

(canceled)

### Claim 10

(canceled)

### Claim 11

(canceled)

### Claim 12

(canceled)

### Claim 13

A method, comprising:
providing, using a processor, a hypercube linked to a graph;
obtaining hierarchical data, comprising:
compiling nodes, edges, and measure formulae into an executable program for traversing the graph;
providing a logical fact table mapping data between the graph and the linked hypercube;
combining the hierarchical data and the logical fact table to obtain an instantiation of the hypercube;
providing a dependency analysis across the graph and hypercube measures; and
preparing a plan that provides a set of all graph and hypercube data at a certain point in time based on a scenario that contains user changes.

### Claim 14 (depends on 13)

The method of claim 13, wherein a link between the graph and the hypercube involves mapping specific members of each of the dimensions of the hypercube to corresponding cube-eligible nodes in the graph.

### Claim 15 (depends on 14)

The method of claim 14, wherein the mapping provides a many-to-one relationship between cube-eligible nodes in the graph and a corresponding member of the hypercube.

### Claim 16 (depends on 13)

The method of claim 13, wherein the providing of the dependency analysis across the graph and the hypercube comprises propagating changes that are entered by a user in a context of a scenario.

### Claim 17 (depends on 13)

The method of claim 13, wherein the method further comprises:
retrieving a base value for a measure either from the graph or from the hypercube, as specified by a user query;
applying a sequential list of changes in dependency order after filtering them based on a subset of changes that are upstream of a current node;
computing an incremental value at the current node based on an application of the subset of changes; and
displaying a final value to the user.

### Claim 18 (depends on 17)

The method of claim 17, wherein the retrieving of the base value for the measure either from the graph or from the hypercube comprises:
specified by a user query;
applying a sequential list of changes in dependency order after filtering them based on a subset of changes that are upstream of the current node;
computing the incremental value at the current node based on the application of the subset of changes; and
displaying the final value to the user.

### Claim 19

A computer program product being embodied in a tangible non-transitory computer readable storage medium and comprising computer instructions for:
providing, using a processor, a hypercube linked to a graph;
obtaining hierarchical data, comprising:
compiling nodes, edges, and measure formulae into an executable program for traversing the graph;
providing a logical fact table mapping data between the graph and the linked hypercube;
combining the hierarchical data and the logical fact table to obtain an instantiation of the hypercube;
providing a dependency analysis across the graph and hypercube measures; and
preparing a plan that provides a set of all graph and hypercube data at a certain point in time based on a scenario that contains user changes.

### Claim 20 (depends on 19)

The computer program product of claim 19, wherein a link between the graph and the hypercube involves mapping specific members of each of the dimensions of the hypercube to corresponding cube-eligible nodes in the graph.

### Claim 21 (depends on 20)

The computer program product of claim 20, wherein the mapping provides a many-to-one relationship between cube-eligible nodes in the graph and a corresponding member of the hypercube.

### Claim 22 (depends on 19)

The computer program product of claim 19, wherein the providing of the dependency analysis across the graph and the hypercube comprises propagating changes that are entered by a user in a context of a scenario.

### Claim 23 (depends on 19)

The computer program product of claim 19, further comprising computer instructions for:
retrieving a base value for a measure either from the graph or from the hypercube, as specified by a user query;
applying a sequential list of changes in dependency order after filtering them based on a subset of changes that are upstream of a current node;
computing an incremental value at the current node based on an application of the subset of changes; and
displaying a final value to the user.

### Claim 24 (depends on 23)

The computer program product of claim 23, wherein the retrieving of the base value for the measure either from the graph or from the hypercube comprises:
specified by a user query;
applying a sequential list of changes in dependency order after filtering them based on a subset of changes that are upstream of the current node;
computing the incremental value at the current node based on the application of the subset of changes; and
displaying the final value to the user.
