| 摘要 |
PROBLEM TO BE SOLVED: To restrain an increase in a comparing frequency, without making updating processing heavier than the number of updated files, even when holding a large number of files. SOLUTION: A file comparing part 14 skips comparing processing of a hierarchy under a node of respective hash values when the respective hash values coincide with each other by front scanning, by mutually comparing the hash values respectively included in server side hash tree information 12a and client side hash tree information 22a. Thus, when the number of updated files is less than the number of holding files, the comparing frequency can be largely reduced. Since the updating processing is performed in a single file unit, the updating processing does not become heavier than the number of updated files. Thus, the problem can be solved. COPYRIGHT: (C)2009,JPO&INPIT
|
