| 摘要 |
<P>PROBLEM TO BE SOLVED: To provide a method of splitting coupled node trees into two and connecting the two coupled node trees. <P>SOLUTION: Coupled node trees are split by obtaining the minimum value or the maximum value of the index keys of the coupled node tree of a processing source, deleting the index keys up to the index key at the split point in sequence, and inserting the deleted index keys into the coupled node tree of a processing destination. One coupled node tree of the processing source in the splitting method is deleted and the other coupled node tree of the processing destination therein is inserted in order to connect the coupled node trees. <P>COPYRIGHT: (C)2008,JPO&INPIT |
