Corrupted Data Segment Repair via Adjacent Backup Matching
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional backup systems face difficulties in repairing corrupted data segments, especially when the corrupted data is offset and cannot be located using fixed-width deduplication algorithms, leading to unusable backups.
Innovation Solution
The system detects corrupted data segments, identifies and ranks additional backups based on probability and stability, matches adjacent data segments to locate uncorrupted versions, and uses these to repair the corrupted segments, even when the corrupted data is offset.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If fixed-width deduplication algorithms are used to locate and repair corrupted data segments, then the repair process is simple and fast, but the algorithm fails to locate offset corrupted segments that have moved from their original position
Solution Approach 1:
The patent segments the corrupted backup into individual data segments and processes each segment separately. By dividing the backup data into discrete segments, the system can independently analyze and repair each segment using adjacent segment information, enabling recovery of offset corrupted segments that fixed-width algorithms cannot locate.
Solution Approach 2:
The patent uses adjacent data segments as intermediaries to locate and repair corrupted segments. Instead of directly searching for the corrupted segment using fixed-width algorithms, the system examines neighboring segments to find matching patterns and use them as references to reconstruct the corrupted data, thereby bridging the gap between corrupted and uncorrupted data.
2Reliability
If multiple copies of backup data are maintained to reduce corruption problems, then data availability improves, but storage space requirements and system complexity increase
Solution Approach 1:
The patent changes the parameter of segment matching from fixed-width to variable-width based on actual data patterns. By using flexible matching criteria that adapt to the actual structure and content of adjacent segments, the system can reliably locate and repair corrupted segments without requiring multiple fixed copies, thereby maintaining data availability while reducing storage overhead and system complexity.
Data Source
AI summary
The disclosed computer-implemented method for repairing corrupted data segments may include (1) detecting a corrupted data segment in a backup stored in a data storage system, (2) identifying at least one additional backup stored in the data storage system that exceeds a predetermined threshold for probability of comprising an uncorrupted version of the corrupted data segment, (3) matching at least a portion of a data segment in the additional backup with at least a portion of a data segment adjacent to the corrupted data segment in the backup, (4) locating, at least in part by examining data adjacent to the matched data segment in the additional backup, the uncorrupted version of the corrupted data segment, and (5) repairing the corrupted data segment in the backup by using the uncorrupted version of the corrupted data segment located in the additional backup. Various other methods, systems, and computer-readable media are also disclosed.