# US 2026/0087009 A1 · System and method for bottom up multidimensional data analysis in complex formulas types

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

- Number: US 2026/0087009 A1
- Document ID: US20260087009A1
- Status: Published application
- Kind: A1
- Application number: 18/898,439
- Filed: 2024-09-26
- Published: 2026-03-26
- Earliest claimed: 2024-09-26
- Assignees: Oracle International Corporation
- Applicants: Oracle International Corporation
- Inventors: Sergei Riaboi; Pralhad Katkade; Natalia Reichman
- Web page: https://patentgrep.com/patent/US20260087009A1

## CPC

- G06F 16/24542: {Plan optimisation}
- 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

Described herein are systems and methods for use with a multidimensional database environment, for providing bottom-up multidimensional data analysis in complex formula types. Complex formulas expressions with conditional branches executed over very sparse regions can result in large computational overheads when the iteration is performed in a top-down mode without a knowledge of the target multidimensional cells that have real base data for evaluation. In accordance with an embodiment, the system employs a bottom-up approach that allows identification of those target cells having real data, and executes only those intersections for complex multidimensional expression evaluation. The bottom-up query path functionality can be activated in autonomous mode. The described approach minimizes the amount of redundant executions that have no base data, in some instances to zero level.

## Claims

### Claim 1

A system for bottom-up multidimensional data analysis, comprising:
a computer that includes one or more microprocessors; and
a multidimensional database server executing on the computer, wherein the multidimensional database comprises a plurality of dimensions, each of the plurality of dimensions comprising a plurality of members;
wherein a query is received, the query being directed to the multidimensional database;
wherein a dependency analysis is performed to determine a set of cells of the multidimensional database that have at least one dependency with an existing data value; and
wherein the query is executed in a bottom-up mode based at least in part upon results of the dependency analysis, wherein the query executed in the bottom-up mode is executed across the set of cells determined by the dependency analysis as having at least one dependency with an existing data value.

### Claim 2 (depends on 1)

The system of claim 1,
wherein the dependency analysis determines a set of cells of the multidimensional database that have at least one dependency with an existing data value.

### Claim 3 (depends on 2)

The system of claim 2,
wherein the query executed in the bottom-up mode is executed across only the set of cells determined by the dependency analysis.

### Claim 4 (depends on 1)

The system of claim 1,
wherein the query comprises at least one conditional expression.

### Claim 5 (depends on 4)

The system of claim 4,
wherein the query comprising the at least one conditional expression has an initial cell query determined by a set of dimensions associated with the query.

### Claim 6 (depends on 5)

The system of claim 5,
wherein the determined set of cells of the multidimensional database is smaller than the initial cell query size determined by the set of dimensions associated with the query.

### Claim 7 (depends on 1)

The system of claim 1,
wherein, based upon the dependency analysis, one or more reverse mappings of dependent member to target are generated.

### Claim 8

A method for bottom-up multidimensional data analysis, comprising:
providing a computer that includes one or more microprocessors;
executing a multidimensional database server on the computer, wherein the multidimensional database comprises a plurality of dimensions, each of the plurality of dimensions comprising a plurality of members;
receiving a query, the query being directed to the multidimensional database;
performing a dependency analysis to determine a set of cells of the multidimensional database that have at least one dependency with an existing data value; and
executing the query in a bottom-up mode based at least in part upon results of the dependency analysis, wherein the query executed in the bottom-up mode is executed across the set of cells determined by the dependency analysis as having at least one dependency with an existing data value.

### Claim at position 9

9-10. (canceled)

### Claim 11 (depends on 8)

The method of claim 8,
wherein the query comprises at least one conditional expression.

### Claim 12 (depends on 11)

The method of claim 11,
wherein the query comprising the at least one conditional expression has an initial cell query determined by a set of dimensions associated with the query.

### Claim 13 (depends on 12)

The method of claim 12,
wherein the determined set of cells of the multidimensional database is smaller than the initial cell query size determined by the set of dimensions associated with the query.

### Claim 14 (depends on 8)

The method of claim 8,
wherein, based upon the dependency analysis, one or more reverse mappings of dependent member to target are generated.

### Claim 15

A non-transitory computer readable storage medium having instructions thereon for bottom-up multidimensional data analysis, which when read and executed cause a computer comprising one or more microprocessors to perform steps comprising:
executing a multidimensional database server on the computer, wherein the multidimensional database comprises a plurality of dimensions, each of the plurality of dimensions comprising a plurality of members;
receiving a query, the query being directed to the multidimensional database;
performing a dependency analysis to determine a set of cells of the multidimensional database that have at least one dependency with an existing data value; and
executing the query in a bottom-up mode based at least in part upon results of the dependency analysis, wherein the query executed in the bottom-up mode is executed across the set of cells determined by the dependency analysis as having at least one dependency with an existing data value.

### Claim at position 15

16-17. (canceled)

### Claim 18 (depends on 15)

The non-transitory computer readable storage medium of claim 15,
wherein the query comprises at least one conditional expression.

### Claim 19 (depends on 18)

The non-transitory computer readable storage medium of claim 18,
wherein the query comprising the at least one conditional expression has an initial cell query determined by a set of dimensions associated with the query.

### Claim 20 (depends on 19)

The non-transitory computer readable storage medium of claim 19,
wherein the determined set of cells of the multidimensional database is smaller than the initial cell query size determined by the set of dimensions associated with the query.

### Claim 21 (depends on 1)

The system of claim 1, wherein the dependency analysis generates a reverse mapping of dependent members to their targets from different formulas expressions, wherein the mappings contain links between the dependent members to their target member lists.

### Claim 22 (depends on 21)

The system of claim 21, wherein the mappings are converted to an intersections-based target keys set, wherein each existing base data intersection receives a set of multidimensional target cells that have at least one dependency with an existing data value.

### Claim 23 (depends on 8)

The method of claim 8, wherein the dependency analysis generates a reverse mapping of dependent members to their targets from different formulas expressions, wherein the mappings contain links between the dependent members to their target member lists.

### Claim 24 (depends on 23)

The method of claim 23, wherein the mappings are converted to an intersections-based target keys set, wherein each existing base data intersection receives a set of multidimensional target cells that have at least one dependency with an existing data value.
