| 摘要 |
<P>PROBLEM TO BE SOLVED: To provide a tree structure of a coupled node tree capable of being stored in storage means with smaller storage capacity. <P>SOLUTION: A branch node includes a discrimination bit position, and a representative node of a link destination node pair is arranged in a sequence element of a node reference number doubling a node reference number of a sequence in which branch node is arranged. A leaf node includes an index key and is arranged only in the lowest level of the tree. A bit value of discrimination bit position of a retrieval key is retrieved for all the branch nodes as branch destination information, and the node reference number of the sequence element in which the link destination node is arranged is retrieved by doubling the node reference number of the link source branch node and adding with the branch destination information. <P>COPYRIGHT: (C)2012,JPO&INPIT |
