Hypercube Base Plan Updates Without Full Scenario Cloning

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing query evaluation systems face challenges in efficiently managing large and complex hypercube data models, particularly in ensuring data consistency and scalability when dealing with frequent data changes, leading to resource-intensive cloning operations and scalability bottlenecks.

Innovation Solution

Implementing a multiversion concurrency control system that uses snapshot chains and anchor objects to manage hypercube versions efficiently, allowing localized storage and reduced memory overhead by referencing base and scenario versions without full duplication.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If complete copies of hypercube versions are stored to ensure data consistency, then data reliability is improved, but memory resource consumption increases substantially

Engineering Contradiction:
Improvedata consistencyVSAvoidmemory resource consumption
Core Design Contradiction:
ReliabilityVSQuantity of substance

Solution Approach 1:

The patent segments the hypercube version management into base version data and version difference data. Instead of storing complete copies of each version, the system stores only the differences (additions, modifications, deletions) relative to the base version. This segmentation reduces memory consumption while maintaining data consistency through structured storage of version increments.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent implements a nested structure where version difference data is embedded within the context of the base version. The version difference records reference the base version and contain only the incremental changes needed to reconstruct full versions when required. This nesting approach allows the system to maintain complete version information logically while storing minimal physical data.

Inventive Principle:
Principle #7Nested doll (Nesting)

2Reliability

If complete hypercube copies are created for each version to maintain data integrity, then data reliability is improved, but processing time increases due to cloning operations

Engineering Contradiction:
Improvedata integrityVSAvoidprocessing time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The patent performs preliminary actions by establishing a base version once and then recording subsequent changes as version differences. When version retrieval is needed, the system pre-computes and caches the reconstructed full versions from the base version and stored differences. This preliminary preparation eliminates the need for time-consuming cloning operations during runtime, as versions are readily available when needed.

Inventive Principle:
Principle #10Preliminary action

3Adaptability or versatility

If full duplication of hypercube data is performed to support scenario versions, then version independence is improved, but scalability deteriorates due to resource constraints

Engineering Contradiction:
Improveversion independenceVSAvoidscalability
Core Design Contradiction:
Adaptability or versatilityVSProductivity

Solution Approach 1:

The patent uses selective copying rather than full duplication. Instead of copying entire hypercube structures for each scenario version, the system copies only the necessary version difference records that define each scenario's deviations from the base version. This selective copying approach maintains scenario independence while dramatically reducing the resources required, enabling the system to scale to support numerous scenario versions simultaneously.

Inventive Principle:
Principle #26Copying

Data Source

PatentUS12468678B2What if scenario planning—updating a base plan version
Publication Date: 2025.11.11 WORKDAY INC
  • US12468678B2 patent drawing
  • US12468678B2 patent drawing
  • US12468678B2 patent drawing

AI summary

A system, method, and device for updating a base version of a hypercube are provided. The method includes (i) obtaining a request for a planning session with respect to a hypercube; and (ii) in response to obtaining the request: (a) determining that the planning session uses a base version of the hypercube, (b) receiving a value input to update a particular location in the hypercube, (c) storing the value for the particular location in the base version of the hypercube, and (d) propagating an update to the particular location of the base version of the hypercube to one or more scenario versions having a dependency on the base version.