| 摘要 |
PROBLEM TO BE SOLVED: To synchronize tree structure data with little traffic even if synchronization cannot be achieved for the transmission of differences. SOLUTION: When a circulation is started at a collection point 10, a target node determining part 103 determines a target node by referring to the order of searches in a search order storage part 101 and check points in a check point storage part 102. Next, a member list creating part 105 creates a list of members for the target node by referring to a link table. Next, the list of members is stored in a member list storage part 106 and the check points are updated. Once the circulation is completed, a group of lists of members is sent to a center 20. The center 20 receives the group of lists of members for each circulation and updates the tree structure data part of a corresponding subtree structure accordingly. COPYRIGHT: (C)2006,JPO&NCIPI
|
