| 摘要 |
A search apparatus includes a graph memory, a root node specification receiving unit, and a search unit. The graph memory stores data of a graph having nodes representing data elements and a link representing a relationship between the data elements. The root node specification receiving unit receives a root node specified from among the nodes in the graph. The search unit searches for an adjacent node which is connected to a target node via a link and which satisfies a search condition that at least one of the target node and the adjacent node has a predetermined attribute. The search unit searches for an adjacent node using the root node as the target node. The search unit iteratively performs a process of searching for an adjacent node using a previously determined adjacent node as the target node for a subsequent iteration to obtain a concatenation of adjacent nodes. |
