| 摘要 |
PROBLEM TO BE SOLVED: To provide an index key insertion/deletion method for a coupled node tree without using a search route stack.SOLUTION: When determining an insertion position of a node pair, retrieval is started again using an index key to be inserted, and it is sequentially decided whether a discrimination bit position of a branch node that is each link destination node is located lower than the first bit position where a different bit value is obtained by bit string comparison with a retrieval result key. When it is decided that the discrimination bit position of the branch node is located lower than the first bit position where the different bit value is obtained by the bit string comparison, the branch node is set as the insertion position of the node pair. In deletion, a backup area of an arrangement number of a link source is used. |
