Efficient Data Deduplication System Considering File Modification Pattern
In a data deduplication system, the performance of data deduplication algorithms is varying on the condition of file contents. For example, if a file is modified at the end of file region then Fixed-Length Chunking algorithm superior to Variable-Length Chunking in terms of computation time with similar space reduction result. Therefore, it is important to predict in which location of a file is modified in a deduplication system. In this paper, the authors discuss a new approach to one of the key methods that is invariably applied to data deduplication. The essential idea is to exploit an efficient le pattern checking scheme that can be used for data deduplication.