基于线性化日志树的连续数据保护技术  

Continuous data protection technology based on linearized log tree

作　　者：杨天明[1] 吴海涛[1] 应时[2] 

机构地区：[1]黄淮学院软件学院,河南驻马店463000 [2]武汉大学计算机学院,湖北武汉430072

出　　处：《计算机工程与设计》2017年第12期3468-3474,共7页Computer Engineering and Design

基　　金：河南教育厅科学技术研究重点基金项目(14A520020)

摘　　要：针对连续数据保护的数据反复恢复问题,提出并讨论丢弃回滚链条、日志树和线性化日志树3种数据恢复技术,实现并测试一种基于线性化日志树的连续数据保护技术LLT-CDP。使用线性化日志树记录数据的所有写操作更新和数据恢复历史,支持对数据进行反复恢复,支持在恢复过程中根据恢复历史对数据进行跃迁恢复。测试结果表明,相较已有技术,LLT-CDP实现反复恢复功能的同时,保证了良好的数据恢复性能。To address the problem of repeated data recovery for continuous data protection(CDP)application,three approaches,i.e.,rollback chain discarding,log tree and linearized log tree(LLT)were proposed and discussed.A continuous data protection technology based on linearized log tree(LLT-CDP)was implemented and experimentally evaluated.A linearized log tree was used to record all data updates and recovery history,which not only enabled data to be recovered to any previous point-in-time repeatedly,but also supported jumping recovery according to the data recovery history.Experimental results show that,compared to existing technologies,LLT-CDP supports repeated data recovery while maintaining good data recovery performance.

关 键 词：数据存储 连续数据保护 数据恢复 日志链 线性化日志树 

分 类 号：TP333[自动化与计算机技术—计算机系统结构]