TREE SEARCH, TOTALIZING, SORT METHOD, INFORMATION PROCESSING DEVICE, AND TREE SEARCH, TOTALIZING, AND SORT PROGRAM

摘要

In a tree data structure that makes it possible to efficiently trace a relationship between data in the tree data structure, trees are efficiently searched for, aggregated, and sorted at high speed. In a method for searching for a tree data structure topology, an array is generated in a memory as a search key array representing a tree serving as a search key to represent a parent-child relationship between nodes. The array has the node identifier assigned to a parent node with which a corresponding non-root node is associated. The non-root nodes are nodes other than a root node, and the node identifier assigned to the parent node corresponds to the node identifier assigned to the associated non-root nodes. An offset is applied to the node identifiers in the search key array, the node identifiers to which the offset is applied are compared with the corresponding node identifiers contained in a portion in a C-P array, the portion being determined according to the offset, and a vertex node list indicating a search result is stored in a storage device, wherein the search result contains the node identifiers included in a portion of the C-P array whose all nodes matched in comparison.