Complex Nodes for Faster Graph-Based Model Operations
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Graph-based models are complicated, time-intensive, and cost-intensive due to frequent retrieval and access of nodes, making them undesirable for implementing systems with frequently executed operations.
Innovation Solution
The creation and maintenance of complex nodes in an executable graph-based model, which combines a set of nodes into a high-level node structure, allowing processing logic to be executed on a single node, reducing time and cost complexity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional graph-based models are used to implement systems with frequently executed operations, then the model can represent real-world entities and their associations, but the frequent retrieval and access of nodes makes the model complicated, time-intensive, and cost-intensive
Solution Approach 1:
The patent merges multiple nodes that are frequently accessed together into a single composite node. This combining of nodes reduces the number of separate retrieval operations needed, thereby decreasing time and cost complexity while maintaining the ability to represent complex relationships. The composite node encapsulates multiple entity representations and their associations, allowing single-point access to what would otherwise require multiple access points.
Solution Approach 2:
The composite node serves multiple functions simultaneously - it represents multiple real-world entities, maintains their associations, and provides a single access point for frequently executed operations. This multi-functionality reduces the overall complexity of the graph model by consolidating what would otherwise require separate nodes and multiple access operations.
2Ease of operation
If nodes are frequently retrieved and accessed for executing operations, then the operations can be performed on the graph-based model, but this frequent access renders the model time-intensive and cost-intensive
Solution Approach 1:
By combining multiple nodes into a single composite node, the patent reduces the number of retrieval operations from multiple separate node accesses to a single composite node access. This merging directly addresses the time loss associated with frequent access while maintaining ease of operation, as the composite node provides a unified interface for executing operations on all constituent entities.
Solution Approach 2:
The composite node is created in advance to encapsulate the set of nodes that will be frequently accessed together. This preliminary structuring of data allows subsequent operations to access all necessary nodes through a single pre-configured access point, eliminating the need for repeated individual node retrieval operations and thereby reducing time consumption.
3Reliability
If the graph-based model structure is maintained with separate nodes for each entity, then the model accurately represents real-world entities, but the frequent access to multiple nodes increases cost and time intensity
Solution Approach 1:
The patent merges multiple separate node representations into a single composite node that preserves the individual entity identities and their relationships. This merging maintains the reliability and accuracy of entity representation while reducing access time, as the composite node structure internally maintains the distinct entity information but provides unified external access.
Solution Approach 2:
The composite node employs a nested structure where multiple individual node representations are contained within the composite node. This nesting allows the model to maintain detailed entity information (preserving reliability) while providing a single outer access point (reducing access time). The nested structure enables both the composite view and individual entity views as needed.
Data Source
AI summary
An overlay system is provided that includes a storage element and processing circuitry coupled thereto. The storage element stores an executable graph-based model having a plurality of nodes. The processing circuitry receives a stimulus indicative of creation of a complex node in the executable graph-based model. The processing circuitry identifies, from the plurality of nodes, a set of nodes associated with the creation of the complex node. The processing circuitry determines, for each of the set of nodes, a node-type that indicates a node behavior of the corresponding node. The processing circuitry further determines, based on the node-type of each of the set of nodes, a complex node behavior that is indicative of a set of operations to be performed for the creation of the complex node. The processing circuitry executes the set of operations on the set of nodes to create the complex node.


