# US 2026/0093681 A1 · Fast batch-style lookup, aggregation, and formula processing system for a multidimensional space

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

- Number: US 2026/0093681 A1
- Document ID: US20260093681A1
- Status: Published application
- Kind: A1
- Application number: 19/411,773
- Filed: 2025-12-08
- Published: 2026-04-02
- Earliest claimed: 2023-08-02
- Assignees: Workday, Inc.
- Applicants: Workday, Inc.
- Inventors: Ngoc Nguyen
- Web page: https://patentgrep.com/patent/US20260093681A1

## CPC

- G06F 16/2264: {Multidimensional index structures}
- G06F 16/2246: {Trees, e.g. B+trees}
- G06F 16/24556: {Aggregation; Duplicate elimination}
- 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

A system, method, and device for evaluating a query is provided. The method includes (i) receiving a query that is indicative of one or more properties of result data, (ii) determining, based at least in part on the query, one or more partitions of a hypercube that are expected to comprise information used in generating result data for a response for the query; (iii) generating a data structure comprising a set of data of the one or more partitions, wherein the data structure is indicative of relationships among data in the set of data; (iv) evaluating the query with respect to the plurality of account groups; and (v) using the data structure to determine the result data based at least in part on an evaluation of the query with respect to the plurality of account groups.

## Claims

### Claim 1

A system, comprising:
one or more processors configured to:
receive a query that is indicative of one or more properties of result data;
determine, based at least in part on the query, one or more partitions of a hypercube, wherein the partitions are non-overlapping dimensional subspaces of the hypercube that are expected to comprise information from which the result data is determined;
deconstruct the query into a set of requests to be evaluated with respect to the one or more partitions;
evaluate the set of requests based at least in part on a plurality of account groups comprising values used in evaluating the query, wherein evaluating the set of requests comprises:
for evaluation of at least a subset of the set of requests,
identifying dependency relationships between requested computations; and
computing roll-up values without redundant computation of intermediate results; and
determine a result for the query based at least in part on a set of results obtained based on the evaluating of the set of requests; and
a memory coupled to the processor and configured to provide the processor with instructions.

### Claim 2 (depends on 1)

The system of claim 1, wherein the query describes attributes of responsive data without specifying a particular set of intersections of the dataset to be queried.

### Claim 3 (depends on 1)

The system of claim 1, wherein evaluating the set of requests further comprises retrieving previously computed roll-up values from a persistent leaf pool indexed to the dependency relationships.

### Claim 4 (depends on 3)

The system of claim 3, wherein the leaf pool comprises an index that identifies, for each roll-up value, the specific combination of leaves or nodes on which the roll-up value depends.

### Claim 5 (depends on 1)

The system of claim 1, wherein:
the one or more processors are further configured to generate, for each dimensional subspace, a data structure comprising a set of data for that dimensional subspace, wherein the data structure is indicative of relationships among data in the set of data; and
the data structure is used in connection with evaluating the set of requests.

### Claim 6 (depends on 5)

The system of claim 5, wherein the data structure is a tree structure.

### Claim 7 (depends on 6)

The system of claim 6, wherein:
generating the data structure comprises determining a set of leaf values to be used in connection with evaluating the query, and determining a relationship between leaf values in the set of leaf values; and
the relationships between leaf values are associated with computation dependencies used to eliminate redundant roll-up computations.

### Claim 8 (depends on 5)

The system of claim 5, wherein the one or more processors are further configured to determine, based at least in part on the data structure, the plurality of account groups, wherein the plurality of account groups is independent and without a dependency across any two account groups in the plurality of account groups.

### Claim 9 (depends on 5)

The system of claim 5, wherein evaluating the query with respect to the plurality of account groups comprises:
computing a plurality of roll-up values based on values for one or more leaves or nodes in the data structure;
determining at least a subset of the plurality of roll-up values that corresponds to unique combinations of the one or more leaves or nodes in the data structure; and
storing, in a leaf pool, the subset of the plurality of roll-up values corresponding to the unique combinations of the one or more leaves or nodes.

### Claim 10 (depends on 9)

The system of claim 9, wherein the evaluating the query with respect to the plurality of account groups comprises:
for each roll-up value to be computed,
determining whether the roll-up value is dependent on one or more previously computed roll-up values stored in the leaf pool; and
in response to determining that the roll-up value is dependent on the one or more previously computed roll-up values stored in the leaf pool, retrieving the one or more previously computed roll-up values from the leaf pool and computing the roll-up value based at least in part on the one or more previously computed roll-up values.

### Claim 11 (depends on 9)

The system of claim 9, wherein for each roll-up value stored in the leaf pool, storing the roll-up value comprises storing an indication of a leaf or a node of the data structure on which the roll-up value depends.

### Claim 12 (depends on 11)

The system of claim 11, wherein the node of the data structure corresponds to a previously computed roll-up value.

### Claim 13 (depends on 11)

The system of claim 11, wherein the storing the indication of the leaf or the node of the data structure on which the roll-up value depends comprises updating a leaf pool index that identifies a combination of leaves or nodes on which a particular roll-up value depends.

### Claim 14 (depends on 1)

The system of claim 1, wherein evaluating the query with respect to the plurality of account groups comprises:
determining one or more formulas in the query;
classifying a pattern for each of the one or more formulas; and
for each of the one or more formulas,
determining whether the pattern is a closed pattern or an open pattern;
in response to determining that the pattern is the open pattern, executing the formula; and
in response to determining that the pattern is the closed pattern, determining one or more accounts on which the formula depends, apply a unary or binary operation on top of children data for the unary or binary operation.

### Claim 15 (depends on 14)

The system of claim 14, wherein the closed pattern corresponds to a formula that can only be evaluated to non-empty for only locations in the data structure comprising data.

### Claim 16 (depends on 14)

The system of claim 14, wherein the open pattern corresponds to a formula that can be evaluated to non-empty on a location of the data structure that has no data.

### Claim 17 (depends on 1)

The system of claim 1, wherein the data structure is stored in local memory while the query is being evaluated.

### Claim 18 (depends on 1)

The system of claim 1, wherein the query defines one or more boundary conditions for the result data.

### Claim 19

A method, comprising:
receiving, by one or more processors, a query that is indicative of one or more properties of result data;
determining, based at least in part on the query, one or more partitions of a hypercube, wherein the partitions are non-overlapping dimensional subspaces of the hypercube that are expected to comprise information from which the result data is determined;
deconstructing the query into a set of requests to be evaluated with respect to the one or more partitions;
evaluating the set of requests based at least in part on a plurality of account groups comprising values used in evaluating the query, wherein evaluating the set of requests comprises:
for evaluation of at least a subset of the set of requests,
identifying dependency relationships between requested computations; and
computing roll-up values without redundant computation of intermediate results; and
evaluating the query based at least in part on a set of results obtained based on the evaluating of the set of requests.

### Claim 20

A computer program product embodied in a non-transitory computer readable medium and comprising computer instructions for:
receiving, by one or more processors, a query that is indicative of one or more properties of result data;
determining, based at least in part on the query, one or more partitions of a hypercube, wherein the partitions are non-overlapping dimensional subspaces of the hypercube that are expected to comprise information from which the result data is determined;
deconstructing the query into a set of requests to be evaluated with respect to the one or more partitions;
evaluating the set of requests based at least in part on a plurality of account groups comprising values used in evaluating the query, wherein evaluating the set of requests comprises:
for evaluation of at least a subset of the set of requests,
identifying dependency relationships between requested computations; and
computing roll-up values without redundant computation of intermediate results; and
evaluating the query based at least in part on a set of results obtained based on the evaluating of the set of requests.
