IEICE TRANSACTIONS on Information
Stride Static Chunking Algorithm for Deduplication System
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Information Vol.E96-D No.7 pp.1544-1547
- Publication Date
- 2013/07/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.E96.D.1544
- Type of Manuscript
- LETTER
- Category
- Computer Systems
Authors
Young-Woong KO
Hallym University
Ho-Min JUNG
Hallym University
Wan-Yeon LEE
Dongduk Womens University
Min-Ja KIM
Korea University
Chuck YOO
Korea University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Young-Woong KO, Ho-Min JUNG, Wan-Yeon LEE, Min-Ja KIM, Chuck YOO, "Stride Static Chunking Algorithm for Deduplication System" in IEICE TRANSACTIONS on Information,
vol. E96-D, no. 7, pp. 1544-1547, July 2013, doi: 10.1587/transinf.E96.D.1544.
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.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E96.D.1544/_p
Copy
@ARTICLE{e96-d_7_1544,
author={Young-Woong KO, Ho-Min JUNG, Wan-Yeon LEE, Min-Ja KIM, Chuck YOO, },
journal={IEICE TRANSACTIONS on Information},
title={Stride Static Chunking Algorithm for Deduplication System},
year={2013},
volume={E96-D},
number={7},
pages={1544-1547},
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={},
doi={10.1587/transinf.E96.D.1544},
ISSN={1745-1361},
month={July},}
Copy
TY - JOUR
TI - Stride Static Chunking Algorithm for Deduplication System
T2 - IEICE TRANSACTIONS on Information
SP - 1544
EP - 1547
AU - Young-Woong KO
AU - Ho-Min JUNG
AU - Wan-Yeon LEE
AU - Min-Ja KIM
AU - Chuck YOO
PY - 2013
DO - 10.1587/transinf.E96.D.1544
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E96-D
IS - 7
JA - IEICE TRANSACTIONS on Information
Y1 - July 2013
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.
ER -
English
