Stride static chunking algorithm for deduplication system

Young Woong Ko, Ho Min Jung, Wan Yeon Lee, Min Ja Kim, Hyuck Yoo

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)1544-1547
Number of pages4
JournalIEICE Transactions on Information and Systems
VolumeE96-D
Issue number7
DOIs
Publication statusPublished - 2013 Jul 1

Fingerprint

Processing

Keywords

  • Byte-shift
  • Deduplication
  • Static chunking
  • Stride

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Software
  • Artificial Intelligence
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition

Cite this

Stride static chunking algorithm for deduplication system. / Ko, Young Woong; Jung, Ho Min; Lee, Wan Yeon; Kim, Min Ja; Yoo, Hyuck.

In: IEICE Transactions on Information and Systems, Vol. E96-D, No. 7, 01.07.2013, p. 1544-1547.

Research output: Contribution to journalArticle

Ko, Young Woong ; Jung, Ho Min ; Lee, Wan Yeon ; Kim, Min Ja ; Yoo, Hyuck. / Stride static chunking algorithm for deduplication system. In: IEICE Transactions on Information and Systems. 2013 ; Vol. E96-D, No. 7. pp. 1544-1547.
@article{b38717c37c3f47efbd76a51dddcfb79b,
title = "Stride static chunking algorithm for deduplication system",
abstract = "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.",
keywords = "Byte-shift, Deduplication, Static chunking, Stride",
author = "Ko, {Young Woong} and Jung, {Ho Min} and Lee, {Wan Yeon} and Kim, {Min Ja} and Hyuck Yoo",
year = "2013",
month = "7",
day = "1",
doi = "10.1587/transinf.E96.D.1544",
language = "English",
volume = "E96-D",
pages = "1544--1547",
journal = "IEICE Transactions on Information and Systems",
issn = "0916-8532",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "7",

}

TY - JOUR

T1 - Stride static chunking algorithm for deduplication system

AU - Ko, Young Woong

AU - Jung, Ho Min

AU - Lee, Wan Yeon

AU - Kim, Min Ja

AU - Yoo, Hyuck

PY - 2013/7/1

Y1 - 2013/7/1

N2 - 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.

AB - 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.

KW - Byte-shift

KW - Deduplication

KW - Static chunking

KW - Stride

UR - http://www.scopus.com/inward/record.url?scp=84880517653&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84880517653&partnerID=8YFLogxK

U2 - 10.1587/transinf.E96.D.1544

DO - 10.1587/transinf.E96.D.1544

M3 - Article

AN - SCOPUS:84880517653

VL - E96-D

SP - 1544

EP - 1547

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

SN - 0916-8532

IS - 7

ER -