Sub-graph Interface Generation for Dynamic Metadata Propagation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing dataflow graph technologies face challenges in converting statically linked sub-graphs to dynamically linked sub-graphs, particularly in metadata propagation, which leads to unexpected results due to mixing of metadata from container and implementation sub-graphs, and requires separation of properties inherent to the implementation sub-graphs from those of the container or implementation sub-graphs.
Innovation Solution
The method involves automatically generating a sub-graph interface from a specified sub-graph, allowing for the separation of metadata propagation directions and constraints, enabling the creation of dynamically linked sub-graphs that conform to multiple container graphs and sub-graph implementations, thereby facilitating more versatile and reusable sub-graph interfaces.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If statically linked sub-graphs are converted to dynamically linked sub-graphs, then adaptability and reusability of sub-graph interfaces are improved, but metadata propagation accuracy deteriorates due to mixing of metadata from container and implementation sub-graphs
Solution Approach 1:
The patent segments metadata into two distinct categories: interface metadata defined in the graph interface specification and implementation metadata defined in the implementation sub-graph. This segmentation prevents mixing of metadata sources and allows each type of metadata to be propagated independently, resolving the contradiction between improved adaptability and maintained metadata accuracy.
Solution Approach 2:
The patent extracts interface metadata from the implementation sub-graph by analyzing the graph interface specification separately. This extraction ensures that only relevant interface metadata is propagated to the container graph, preventing contamination from implementation-specific metadata while maintaining accurate metadata propagation.
2Adaptability or versatility
If dynamically linked sub-graphs are created with separate metadata propagation directions, then versatility of sub-graph interfaces is improved, but device complexity increases due to additional interface elements and properties
Solution Approach 1:
The patent creates a universal graph interface specification that can be used across multiple container graphs and implementation sub-graphs. This universal interface defines a standardized set of interface elements and metadata properties that work consistently in different contexts, achieving versatility without proportionally increasing complexity.
Solution Approach 2:
The patent performs preliminary analysis of the graph interface specification to automatically identify and configure interface elements with appropriate metadata propagation directions before the sub-graph is instantiated. This preliminary action establishes the metadata propagation framework in advance, reducing the complexity burden during runtime execution.
3Manufacturing precision
If interface elements are configured with metadata propagation directions, then metadata propagation accuracy is improved, but ease of operation deteriorates due to additional configuration requirements
Solution Approach 1:
The patent implements self-service configuration where interface elements automatically determine their metadata propagation direction based on their role in the graph interface specification. Input ports automatically configure for inward propagation, output ports for outward propagation, and internal ports based on their connection patterns, eliminating manual configuration requirements while maintaining high accuracy.
Solution Approach 2:
The patent incorporates feedback mechanisms that automatically analyze the graph interface specification and adjust metadata propagation directions based on the actual structure and requirements of the interface. This feedback loop ensures accurate metadata propagation without requiring manual intervention from operators.
Data Source
Figure 1
Figure 2A
Figure 2B
AI summary
A method for determining a graph interface (210), is provided. A specification (400) including a description of a first directed graph including a plurality of components (302A-302D) interconnected by directed links (306A-306D) is received by a computer. The computer (100) automatically forms the graph interface (210) for the first directed graph, the graph interface being a placeholder in a container graph to be replaced by an implementation that conforms to the graph interface prior to execution of the container graph. Automatically forming the graph interface (210) includes: analyzing the first directed graph to identify information for forming one or more interface elements of the graph interface (210), and forming the one or more interface elements, each of at least some interface elements of the one or more interface elements being associated with one or more properties including at least one of a metadata descriptor property or a direction of metadata propagation property; and for each of at least some interface elements of the one or more interface elements, analyzing the first directed graph to determine whether a value of the metadata descriptor property associated with the interface element is propagated to the interface element from the first directed graph or is propagated to the interface element from a second directed graph that is a container graph in which the graph interface is utilized, and configuring the direction of metadata propagation property for the interface element based on a result of the analysis. A corresponding computer program and system for performing the method are also provided.