Stride Static Chunking Algorithm for Deduplication System

Young-Woong KO  Ho-Min JUNG  Wan-Yeon LEE  Min-Ja KIM  Chuck YOO  

IEICE TRANSACTIONS on Information and Systems   Vol.E96-D   No.7   pp.1544-1547
Publication Date: 2013/07/01
Online ISSN: 1745-1361
DOI: 10.1587/transinf.E96.D.1544
Print ISSN: 0916-8532
Type of Manuscript: LETTER
Category: Computer Systems
static chunking,  stride,  deduplication,  byte-shift,  

Full Text: PDF>>
Buy this Article

In this paper, we propose a stride static chunking deduplication algorithm using a hybrid approach that exploits the advantages of static chunking and byte-shift chunking algorithm. The key contribution of our approach is to reduce the computation time and enhance deduplication performance. We assume that duplicated data blocks are generally gathered into groups; thus, if we find one duplicated data block using byte-shift, then we can find subsequent data blocks with the static chunking approach. Experimental results show that stride static chunking algorithm gives significant benefits over static chunking, byte-shift chunking and variable-length chunking algorithm, particularly for reducing processing time and storage space.