Directed Acyclic Graph Update Method for PLM Systems
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In Product Lifecycle Management (PLM) systems, updating modeled objects with interrelated data is complex, especially in collaborative environments, leading to network congestion and performance degradation due to high data consumption and resource overload.
Innovation Solution
A computer-implemented method using a directed acyclic graph to identify and update only the nodes impacting a modeled object, reducing the number of objects to be considered by building a first path of successive nodes and computing a second path of nodes that affect the update, thereby propagating updates efficiently and reducing data processing and transmission.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If all interrelated objects are updated in a PLM system, then data consistency is maintained, but network congestion and performance degradation occur
Solution Approach 1:
The patent segments the set of interrelated objects into two distinct groups: a first set of objects that directly impact the modeled object and require updates, and a second set of objects that do not impact the modeled object and can be excluded from updates. This segmentation is achieved by analyzing the directed acyclic graph to identify only those objects lying on paths from the modeled object to leaf nodes, thereby maintaining data consistency for relevant objects while avoiding unnecessary network traffic and resource consumption for irrelevant objects.
2Manufacturing precision
If complete data sets are transmitted for updates, then update accuracy is ensured, but data processing time increases
Solution Approach 1:
The patent extracts and transmits only the necessary subset of data required for accurate updates. By identifying and selecting exclusively those objects in the first set that lie on critical paths from the modeled object to leaf nodes in the directed acyclic graph, the system extracts the minimal necessary data subset that still ensures complete and accurate updates of the modeled object, thereby reducing data processing time while maintaining update accuracy.
3Reliability
If all nodes in the directed acyclic graph are considered for updates, then comprehensive coverage is achieved, but system resource overload occurs
Solution Approach 1:
The patent applies local quality by treating different nodes in the directed acyclic graph differently based on their specific relationship to the modeled object. Nodes that lie on paths from the modeled object to leaf nodes are identified as requiring updates (first set), while other nodes are excluded (second set). This differentiated treatment ensures that update operations are performed only where necessary, achieving comprehensive coverage of all impacted objects while minimizing system resource consumption by avoiding processing of unaffected objects.
Data Source
AI summary
A computer-implemented method and system for updating a modeled object in a Product Lifecycle Management system is disclosed. The modeled object to be updated is modeled with a directed acyclic graph having at least one path. The path is formed of nodes and arcs, where: (i) each node represents a modeled object, and (ii) each arc represents the use of a respective end node by a corresponding origin node. The invention method and system build a first path of all successive nodes used by the modeled object to be updated. Next the invention method and system compute from the first path, a second path of nodes impacting the update of the modeled object to be updated. In turn, the invention method and system update the modeled object to be updated by using the nodes of the second path. The invention also provides a computerized system, such as a Product Lifecycle Management (PLM) system, comprising program code means for carrying out the method of the present invention.