Executable Graph Templates for Low-Latency Runtime Node Composition

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing n-tier architectures separate data storage from processing logic, leading to impedance mismatches and reduced flexibility, extensibility, and responsiveness, which is detrimental in time-critical applications.

Innovation Solution

The integration of data and data processing functionality within a single executable graph-based model, utilizing template-driven generation to combine data and processing logic dynamically at run-time, maintaining separability when offline.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Ease of manufacture

If data and processing logic are separated into different tiers (n-tier architecture), then system modularity and maintainability are improved, but system flexibility and responsiveness deteriorate

Engineering Contradiction:
Improvesystem modularityVSAvoidsystem flexibility
Core Design Contradiction:
Ease of manufactureVSAdaptability or versatility

Solution Approach 1:

The system segments processing logic into reusable overlays that can be independently developed and maintained, while allowing dynamic composition at runtime. Each overlay represents a modular unit of functionality that can be selectively applied to graph nodes, providing both modularity and flexibility.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The system employs runtime graph compilation where the structure and behavior of the system are determined dynamically based on input data. Graph nodes and overlays are composed at runtime rather than being fixed at deployment, allowing the system to adapt its behavior based on actual data characteristics and requirements.

Inventive Principle:
Principle #15Dynamics

2Ease of manufacture

If data and processing logic are separated into different tiers, then technical separation of concerns is achieved, but processing latency increases

Engineering Contradiction:
Improveseparation of concernsVSAvoidprocessing latency
Core Design Contradiction:
Ease of manufactureVSLoss of time

Solution Approach 1:

The system merges data and processing logic into a unified graph-based model at runtime. The graph structure inherently combines data representation and processing behavior, eliminating the need for repeated data serialization and deserialization between tiers, thus reducing latency while maintaining separation of concerns through the overlay mechanism.

Inventive Principle:
Principle #5Merging (Combining)

3Stability of the object's composition

If traditional n-tier architecture is used, then system stability and data integrity are maintained, but responsiveness to time-critical operations deteriorates

Engineering Contradiction:
Improvedata integrityVSAvoidresponsiveness
Core Design Contradiction:
Stability of the object's compositionVSSpeed

Solution Approach 1:

The system performs preliminary validation and structure definition through schema-based graph templates. Data integrity constraints are embedded in the graph schema and overlay definitions, allowing validation to occur during graph construction rather than during data access operations, thus maintaining integrity while improving responsiveness.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS12619661B2Systems and methods for templating of executable graph-based models
Publication Date: 2026.05.05 INFOSYS LTD
  • US12619661B2 patent drawing
  • US12619661B2 patent drawing
  • US12619661B2 patent drawing

AI summary

A method for loading run-time nodes of a template-based executable graph-based model is provided. A node instance manifest state is obtained based on a first node identifier associated with a node instance. The node instance manifest state includes a second node identifier associated with a node template. A node instance manifest is generated from the node instance manifest state. The node instance manifest comprises a first storage location and the first node identifier. A node instance state is obtained from the first storage location. The node template is obtained based on the second node identifier. The node instance is generated from the node instance manifest, the node instance state, and the node template. A run-time node, comprising a composition of the node instance and the node template, is generated.