Abstract
When the continuous data protection(CDP)system performs data recovery after data corruption,the primary task is to quickly determine a recovery point that provides a clean copy of the data.The total recovery time is proportional to the number of historical copies examined in the process of recovery point identification.The high availability and high reliability of computerized data has a raise requirement for modern storage systems.But the recovery efficiency of basic recovery method for block-level continuous data protection is low,and the contradiction between the recovery speed and data loss become increasingly prominent.After improve and refine the neighboring point data recovery method,this paper presents a recovery method for CDP based on data discrepancies(RM-CBDD).In multi-gap situations,RM-CBDD performs data recovery by eliminating the data discrepancies between starting and ending points.Experimental evaluation demonstrates that the recovery efficiency of RM-CBDD is significantly better than basic method and WDRS,especially the binary search for optimal recovery point identification.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
