earticle

논문검색

Byte-index Chunking Algorithm for Data Deduplication System

초록

영어

This paper presents an algorithm and structure for a deduplication method which can be efficiently used for eliminating identical data between files existing different machines with high rate and performing it within rapid time. The algorithm predicts identical parts between source and destination files very fast, and then assures the identical parts and transfers only those parts of blocks that proved to be unique region. The fundamental aspect of reaching faster and high scalability determining duplicate result is that data are expressed as fixed-size block chunks which are distributed to “Index-table” by chunk’s both side boundary values. “Index-table” is a fixed sized table structure; chunk’s boundary byte values are used as their cell row and column numbers. Experiment result shows that the proposed solution enhances data deduplication performance and reduces data storage capacity extensively.

목차

Abstract
 1. Introduction
 2. Related Works
 3. Design and Implementation of Byte-index chunking
  3.1. Byte-index Chunking Algorithm Concept
  3.2. Predicting Duplicated Data with Look-up Process
  3.3. Verifying Predicting Chunks to be Duplicated
 4. Performance Evaluation
 5. Conclusion
 Acknowledgements
 References

저자정보

  • Ider Lkhagvasuren Dept. of Computer Engineering, Hallym University Chuncheon
  • Jung Min So Dept. of Computer Engineering, Hallym University Chuncheon
  • Jeong Gun Lee Dept. of Computer Engineering, Hallym University Chuncheon
  • Chuck Yoo Dept. of Computer Science and Engineering, Korea University
  • Young Woong Ko Dept. of Computer Engineering, Hallym University Chuncheon

참고문헌

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

    함께 이용한 논문

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

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