Quick file comparison method, system and client side

Abstract

The invention relates to a quick file comparison method, a quick file comparison system and a quick file comparison client side. The quick file comparison method comprises the steps of: e scanning and analyzing a local file directory by the client side; according to the variation of the local file system, updating a first identification tree maintained by the client side; corresponding a node in the first identification tree to each local directory of the client side, wherein node information comprises a node identification and relevant directory information; comparing a second identification tree maintained by server side equipment with the first identification tree node by node by the client side; recording a difference node and a variation file corresponding to the difference node; and according to the difference node and the variation file, providing data to the server side equipment section by the client side so as to update the second identification tree maintained by server side equipment and a stored file. According to the quick file comparison method, a mode of comparing node information for reflecting the local file system of the client side is adopted, and due to the mode, the quickness is realized, the mode is more suitable for bigger and a more complex file system, and the file comparison efficiency and performance can be effectively improved.

Description

technical field [0001] The invention relates to the field of file processing, in particular to a fast file comparison method and system. Background technique [0002] In file processing technology, in order to organize and manage the file system more effectively, it is often necessary to organize and arrange files according to certain rules. This organization and arrangement usually leads to a highly complicated file structure, resulting in a sharp decline in data search performance. . In the file management process, the current file comparison operation generally uses all byte comparisons between files to determine whether the files are the same. This comparison method is feasible in a small file system, but in a large-scale Complex or single-file bulky file systems are nearly impossible, and judgments based on simple file attributes are often inaccurate. [0003] In addition, the source file and the backup file are often stored in different physical media due to factors ...

AI Technical Summary

Problems solved by technology

[0002] In file processing technology, in order to organize and manage the file system more effectively, it is often necessary to organize and arrange files according to certain rules. This organization and arrangement usually leads to a highly complicated file structure, resulting in a sharp decline in data search performance.

In the file management process, the current file comparison operation generally uses all byte comparisons between files to determine whether the files are the same. This comparison method is feasible in a small file system, but in a large-scale Complicated or single-file bulky file systems are almost infeasible, and judgments based on simple file attributes are often inaccurate

[0003] In addition, the source file and the backup file are often stored in different physical media due to factors such as security, which increases the burden on the input and output devices when operating files, and reduces the processing efficiency of the device.

In file operations, the current file comparison method is to obtain the hash value of the file through a hash function to achieve file comparison. Although it effectively solves the performance bottleneck of a single large file comparison, the source file and When comparing backup files, M+N comparisons are performed based on the number M of file structures and the number N of files. Frequent operations between source files and backup files between different physical media cause performance degradation

Images