De-Duplication System Based on Suffix Structure for the Block Size Optimization
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    To further improve the performance of data de-duplication system, the paper brings out a de-duplication system based on data blocks’ suffix array and longest common prefix for the block size optimization. The method first chunks input data into segments with a first size, then identifies the segments and create the indexes queue for the identifiers, and then create the suffix array and the longest common prefix structure from the indexes, next determines a second optimize size based on repeated indexes sequences and non-repeated indexes, finally chunks the input data into segments based on super chunks and saves the compression result. The result shows that it achieves a better compression ratio and object reconstruction for the given input data comparing the original fixed chunk segment size.

    Reference
    Related
    Cited by
Get Citation

黄晨晖,林泳琴.基于后缀结构进行数据块优化的重复数据删除系统.计算机系统应用,2010,19(11):75-78

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:March 03,2010
  • Revised:April 06,2010
  • Adopted:
  • Online:
  • Published:
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063