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 language | English |
---|---|
Pages (from-to) | 1544-1547 |
Number of pages | 4 |
Journal | IEICE Transactions on Information and Systems |
Volume | E96-D |
Issue number | 7 |
DOIs | |
Publication status | Published - 2013 Jul |
Keywords
- Byte-shift
- Deduplication
- Static chunking
- Stride
ASJC Scopus subject areas
- Software
- Hardware and Architecture
- Computer Vision and Pattern Recognition
- Electrical and Electronic Engineering
- Artificial Intelligence