Key points are not available for this paper at this time.
File similarity is widely used in information security, vulnerability detection, image retrieval, IP protection and other fields. Hash algorithms can be used to compute the similarity between two identical or basically identical files. However, if sizes of files are different extraordinary, hash cannot accurately reflect their similarity. Analysis shows that the main reason for this problem is that the traditional similarity has nothing to do with file sizes, since files of different sizes are mapped to hash values of fixed length. For this reason, we propose a file-size-dependent similarity definition to solve this problem in this paper, and propose a file similarity algorithm which combines the traditional CTPH algorithm and the edit distance algorithm to solve the similarity problem of size-different files. An experimental environment was built to verify the accuracy and efficiency of the algorithm.
chen et al. (Mon,) studied this question.