Similar assembly-model structure search system and similar assembly-model structure search method
US-2015186457-A1 · Jul 2, 2015 · US
US9727662B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9727662-B2 |
| Application number | US-201414308738-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jun 19, 2014 |
| Priority date | Jul 16, 2013 |
| Publication date | Aug 8, 2017 |
| Grant date | Aug 8, 2017 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A data output method includes: generating, by a computer, (n−1) first conditions (n is an integer number of three or more) on a relationship between two data by dividing, in a sequential order, a common element condition in which an attribute of each of n data includes a common element, the attribute of each of the two data including the common element; extracting first data corresponding to each of n data to set the first data as a node under a condition; creating a first graph in which nodes are coupled with links based on the first condition; creating a second graph by repeatedly performing a first process, a second process and a third process; determining candidates of a combination of data from the second graph; and outputting a combination of data satisfying the common element condition from the candidates of a combination of data.
Opening claim text (preview).
What is claimed is: 1. A data output method comprising: generating, by a computer, (n−1) first conditions (n is an integer number of three or more) on a relationship between two data by dividing, in a sequential order, a common element condition in which an attribute of each of n data includes a common element and which is included in a plurality of conditions; extracting a plurality of second data satisfying respective second conditions on one data among the plurality of conditions, from a plurality of first data, as nodes; extracting, from the nodes, combinations of two nodes satisfying the respective first conditions; creating a first graph by coupling the two nodes of each of the combinations with links; creating a second graph by deleting a node which does not include a common element between a first set of elements obtained by tracing the links in a first direction and a second set of elements obtained by tracing the links in a second direction opposite to the first direction; determining candidates of a combination of data from the second graph; and outputting a combination of data satisfying the common element condition from the candidates of a combination of data. 2. The data output method according to claim 1 , wherein the deleting is performed until a node to be deleted does not exist. 3. The data output method according to claim 1 , further comprising: extracting, from the nodes, combinations of two nodes satisfying respective third conditions on a relationship between two data among the plurality of conditions; and deleting a node that does not satisfy one of the third conditions. 4. The data output method according to claim 1 , wherein the first set of elements is obtained by acquiring a product set between elements of one or more nodes linked with an own node in a first direction and elements of the own node, and the second set of elements is obtained by acquiring a product set between elements of one or more nodes linked with the own node in a second direction opposite to the first direction and elements of the own node. 5. A computer-readable recording medium storing a data output program for causing a computer to execute operations of: generating (n−1) first conditions (n is an integer number of three or more) on a relationship between two data by dividing, in a sequential order, a common element condition in which an attribute of each of n data includes a common element and which is included in a plurality of conditions; extracting a plurality of second data satisfying respective second conditions on one data among the plurality of conditions, from a plurality of first data, as nodes; extracting, from the nodes, combinations of two nodes satisfying the respective first conditions; creating a first graph by coupling the two nodes of each of the combinations with links; creating a second graph by deleting a node which does not include a common element between a first set of elements obtained by tracing the links in a first direction and a second set of elements obtained by tracing the links in a second direction opposite to the first direction; determining candidates of a combination of data from the second graph; and outputting a combination of data satisfying the common element condition from the candidates of a combination of data. 6. The computer-readable recording medium according to claim 5 , wherein the deleting is performed until a node to be deleted does not exist. 7. The computer-readable recording medium according to claim 5 , further comprising: extracting, from the nodes, combinations of two nodes satisfying respective third conditions on a relationship between two data among the plurality of conditions; and deleting a node that does not satisfy one of the third conditions. 8. The computer-readable recording medium according to claim 5 , wherein the first set of elements is obtained by acquiring a product set between elements of one or more nodes linked with an own node in a first direction and elements of the own node, and the second set of elements is obtained by acquiring a product set between elements of one or more nodes linked with the own node in a second direction opposite to the first direction and elements of the own node. 9. A data output system, comprising: a memory configured to store a data output program: a computer processing unit configured to execute a program to perform operations of: generating (n−1) first conditions (n is an integer number of three or more) on a relationship between two data by dividing, in a sequential order, a common element condition in which an attribute of each of n data includes a common element and which is included in a plurality of conditions; extracting a plurality of second data satisfying respective second conditions on one data among the plurality of conditions, from a plurality of first data, as nodes; extracting, from the nodes, combinations of two nodes satisfying the respective first conditions; creating a first graph by coupling the two nodes of each of the combinations with links; creating a second graph by deleting a node which does not include a common element between a first set of elements obtained by tracing the links in a first direction and a second set of elements obtained by tracing the links in a second direction opposite to the first direction; determining candidates of a combination of data from the second graph; and outputting a combination of data satisfying the common element condition from the candidates of a combination of data. 10. The data output system according to claim 9 , wherein the deleting is performed until a node to be deleted does not exist. 11. The data output system according to claim 9 , further comprising: extracting, from the nodes, combinations of two nodes satisfying respective third conditions on a relationship between two data among the plurality of conditions; and deleting a node that does not satisfy one of the third conditions. 12. The data output system according to claim 9 , wherein the first set of elements is obtained by acquiring a product set between elements of one or more nodes linked with an own node in a first direction and elements of the own node, and the second set of elements is obtained by acquiring a product set between elements of one or more nodes linked with the own node in a second direction opposite to the first direction and elements of the own node.
Graphs; Linked lists (G06F16/9027 takes precedence) · CPC title
Physics · mapped topic
Related publications grouped by family.
Answers are generated from the same data shown on this page.