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

摘要

In a tree-type data structure capable of effectively tracing the relationshipbetween data of the tree-type data structure, it is possible to search,totalize, and sort a tree effectively and rapidly. In a method for searchingtopology of the tree type data structure, as a search key arrangementexpressing the tree as a search key, it is necessary to generate in a memory,an arrangement having a node identifier of a parent node associated with eachof non-route nodes corresponding to node identifiers assigned to non-routenodes, i.e., nodes other than route nodes for expressing the parent-childrelationship. An offset is given to the node identifier in the search keyarrangement. The node identifier to which the offset is given is compared to acorresponding node identifier contained in a part of the C-P arrangement basedon the offset so as to generate an apex node list indicating the search resultand containing a node identifier of the part of the C-P arrangement where allhave coincided, in a storage device.