Ecient Data Deduplication System Considering File Modication Pattern
暂无分享,去创建一个
In a data deduplication system, the performance of data deduplication algorithms are varying on the condition of le contents. For example, if a le is modied at the end of le 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 le is modied in a deduplication system. In this paper, we discuss a new approach to one of the key methods that is invariably applied to data deduplication. The essential idea is to exploit an ecient le pattern checking scheme that can be used for data deduplication. The contribution of this paper is to nd in which region of a le is modied using le similarity information. The le modication pattern can be used for elaborating data deduplication system for selecting deduplication algorithm. Experiment result shows that the proposed system can predict le modication region with high probability.
[1] Fred Douglis,et al. USENIX Association Proceedings of the General Track : 2003 USENIX Annual , 2003 .
[2] Hoon-Joon Kouh,et al. A Study on AES Extension for Large-Scale Data , 2009 .
[3] Fred Douglis,et al. Redundancy Elimination Within Large Collections of Files , 2004, USENIX Annual Technical Conference, General Track.
[4] Ki-Young Lee,et al. Design and Implementation of a Data Management System for Mobile Spatio-Temporal Query , 2011 .