• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Zhang Yao, Chu Jiajia, Weng Chuliang. Survey on Data Updating in Erasure-Coded Storage Systems[J]. Journal of Computer Research and Development, 2020, 57(11): 2419-2431. DOI: 10.7544/issn1000-1239.2020.20190675
Citation: Zhang Yao, Chu Jiajia, Weng Chuliang. Survey on Data Updating in Erasure-Coded Storage Systems[J]. Journal of Computer Research and Development, 2020, 57(11): 2419-2431. DOI: 10.7544/issn1000-1239.2020.20190675

Survey on Data Updating in Erasure-Coded Storage Systems

Funds: This work was supported by the National Natural Science Foundation of China (61772204, 61732014).
More Information
  • Published Date: October 31, 2020
  • In a distributed storage system, node failure has become a normal state. In order to ensure high availability of data, the system usually adopts data redundancy. At present, there are mainly two kinds of redundancy mechanisms. One is multiple replications, and the other is erasure coding. With the increasing amount of data, the benefits of the multi-copy mechanism are getting lower and lower, and people are turning their attention to erasure codes with higher storage efficiency. However, the complicated rules of the erasure coding itself cause the overhead of the read, write, and update operations of the distributed storage systems using the erasure coding to be larger than that of the multiple copies. Therefore, erasure coding is usually used for cold data or warm data storage. Hot data, which requires frequent access and update, is still stored in multiple copies. This paper focuses on the data update in erasure-coded storage systems, summarizes the current optimization work related to erasure coding update from the aspects of hard disk I/O, network transmission and system optimization, makes a comparative analysis on the update performance of representative coding schemes at present, and finally looks forward to the future research trends. Through analysis, it is concluded that the current erasure coding update schemes still cannot obtain the update performance similar to that of multiple copies. How to optimize the erasure-coded storage system in the context of erasure coding update rules and system architecture, so that it can replace the multi-copy mechanism under the hot data scenario, and reducing the hot data storage overhead is still a problem worthy of further study in the future.
  • Related Articles

    [1]Xie Wenbing, Guan Ruixue, Zhang Yiming, Li Jiamei, Wang Jun. Efficient Optimization of Erasure Coding for Storage Library[J]. Journal of Computer Research and Development. DOI: 10.7544/issn1000-1239.202440091
    [2]Bao Han, Wang Yijie. A Fast Construction Method of the Erasure Code with Small Cross-Cloud Data Center Repair Traffic[J]. Journal of Computer Research and Development, 2023, 60(10): 2418-2439. DOI: 10.7544/issn1000-1239.202220580
    [3]Zhang Zilin, Liu Duo, Tan Yujuan, Wu Yu, Luo Longpan, Wang Weilüe, Qiao Lei. An Erasure-Coded Data Update Method for Distributed Storage Clusters[J]. Journal of Computer Research and Development, 2022, 59(11): 2451-2466. DOI: 10.7544/issn1000-1239.20210211
    [4]Liao Xiaojian, Yang Zhe, Yang Hongzhang, Tu Yaofeng, Shu Jiwu. A Low-Latency Storage Engine with Low CPU Overhead[J]. Journal of Computer Research and Development, 2022, 59(3): 489-498. DOI: 10.7544/issn1000-1239.20210574
    [5]Li Qian, Hu Yupeng, Ye Zhenyu, Xiao Ye, Qin Zheng. An Ant Colony Optimization Algorithms Based Data Update Scheme for Erasure-Coded Storage Systems[J]. Journal of Computer Research and Development, 2021, 58(2): 305-318. DOI: 10.7544/issn1000-1239.2021.20200383
    [6]Xu Guangwei, Shi Chunhong, Feng Xiangyang, Luo Xin, Shi Xiujin, Han Songhua, Li Wei. Multi-Replica Cloud Data Storage Based on Hierarchical Network Coding[J]. Journal of Computer Research and Development, 2021, 58(2): 293-304. DOI: 10.7544/issn1000-1239.2021.20200340
    [7]Tang Yingjie, Wang Fang, Xie Yanwen. An Efficient Failure Reconstruction Based on In-Network Computing for Erasure-Coded Storage Systems[J]. Journal of Computer Research and Development, 2019, 56(4): 767-778. DOI: 10.7544/issn1000-1239.2019.20170834
    [8]Wu Qiyu, Zhou Fucai, Wang Qiang, Li Yuxi. Publicly Verifiable Databases Scheme with Efficient Updates and Low Storage Overhead[J]. Journal of Computer Research and Development, 2018, 55(8): 1800-1808. DOI: 10.7544/issn1000-1239.2018.20170320
    [9]Fu Yingxun, Wen Shilin, Ma Li, Shu Jiwu. Survey on Single Disk Failure Recovery Methods for Erasure Coded Storage Systems[J]. Journal of Computer Research and Development, 2018, 55(1): 1-13. DOI: 10.7544/issn1000-1239.2018.20160506
    [10]Fu Yanyan, Zhang Min, Chen Kaiqu, Feng Dengguo. Proofs of Data Possession of Multiple Copies[J]. Journal of Computer Research and Development, 2014, 51(7): 1410-1416.
  • Cited by

    Periodical cited type(8)

    1. 倪小芳. 分布式存储纠删码技术的性能研究. 工业控制计算机. 2025(01): 60-62 .
    2. 黎聪,唐聃. S-E-MBR:一种基于E-MBR码的分布式存储系统扩容方法. 软件导刊. 2024(01): 90-96 .
    3. 李萧言,安阳. 基于扩容阈值的磁盘阵列故障恢复分析. 信息记录材料. 2024(01): 191-193 .
    4. 王锋. 基于GIS技术的森林资源数据更新方法. 中国林副特产. 2024(02): 25-26+30 .
    5. 孙淳晔,庞亚南,邓芳. 分布式存储在运营商中的应用与研究. 广东通信技术. 2023(02): 71-74 .
    6. 赵银瑞,殷双飞,陕振,王梓斌. 基于树结构的纠删码数据更新策略. 计算机工程与设计. 2023(03): 725-731 .
    7. 沈佳杰,向望,沈敏虎,武博淳,赵泽宇,张凯. 纠删码存储系统中数据修复性能优化研究进展与展望. 广西科学. 2023(01): 149-168 .
    8. 章紫琳,刘铎,谭玉娟,吴宇,罗龙攀,王纬略,乔磊. 一种适用于分布式存储集群的纠删码数据更新方法. 计算机研究与发展. 2022(11): 2451-2466 . 本站查看

    Other cited types(18)

Catalog

    Article views (970) PDF downloads (487) Cited by(26)

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return