earticle

논문검색

Effcient Data Deduplication System Considering File Modification 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.

목차

Abstract
 1 Introduction
 2 System overview
  2.1 File similarity search
  2.2 File pattern search algorithm
 3 Performance evaluation
 4 Conclusion
 References

저자정보

  • Ho Min Jung Department of Computer Engineering, Hallym University, Chuncheon, Korea
  • Sang Yong Park Department of Computer Engineering, Hallym University, Chuncheon, Korea
  • Jeong Gun Lee Department of Computer Engineering, Hallym University, Chuncheon, Korea
  • Young Woong Ko Department of Computer Engineering, Hallym University, Chuncheon, Korea

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.