发明名称 |
Methods and systems for filtering tree node data to determine part and assembly relationships |
摘要 |
A computer-based method for generating multi-generational relationships within a relational model. The method includes applying, with a processing device, a filter to parent node data and child node data in the relational model, the relational model stored in a computer memory, adding filtered data to a database within a computer memory via instructions executed by the processing device, the filtered data including relational model data that passed through the filter, and applying, through instructions executed by the processing device, a parent node selection process to every child node in the filtered data that is associated with a parent node record not conforming to the filter. |
申请公布号 |
US9141650(B1) |
申请公布日期 |
2015.09.22 |
申请号 |
US201113312389 |
申请日期 |
2011.12.06 |
申请人 |
The Boeing Company |
发明人 |
Nicks Eric L.;Gunther Steven M.;Cress, Jr. James Michael;Thompson Robert C. |
分类号 |
G06F17/30 |
主分类号 |
G06F17/30 |
代理机构 |
Armstrong Teasdale LLP |
代理人 |
Armstrong Teasdale LLP |
主权项 |
1. A computer-based method for generating multi-generational relationships within a relational model, the method comprising:
applying, with a processing device, a filter to parent node data and child node data in the relational model to produce filtered data, the relational model comprises relational model data stored in a computer memory and is structured as a first tree; adding the filtered data to a database within the computer memory via instructions executed by the processing device, the filtered data including a subset of the relational model data that passed through the filter, wherein the filtered data is structured as a second tree; applying, through instructions executed by the processing device, a parent node selection process to every child node in the filtered data that is associated with a parent node record not conforming to the filter, wherein the applying comprises:
creating the second tree;copying a root node of the first tree to a root node of the second tree;passing the plurality of child nodes of the first tree as a parameter to an algorithm;adding each tree returned from the algorithm as a child node to the root node of the second tree;checking a first level of the first tree provided as an input parameter to see if any node in the first level is filtered;for any filtered node, traversing down a branch of the first tree until unfiltered child nodes are found to replace the filtered node; andreplacing the filtered node with the unfiltered child nodes in the branch. |
地址 |
Chicago IL US |