Segmented Data Recovery via Check Code Verification

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing multi-copy data storage technologies fail to recover data when all copies are damaged, leading to permanent data loss and low security.

Innovation Solution

Divide data into multiple segments, generate multiple copies with each segment containing part of the content, and use check codes to detect and replace damaged segments with undamaged ones, ensuring data integrity and recovery even if all copies are damaged.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If multiple same copies are generated and stored in different databases, then data reliability is enhanced when some copies are damaged, but data cannot be recovered when all copies are damaged

Engineering Contradiction:
Improvedata reliabilityVSAvoiddata loss
Core Design Contradiction:
ReliabilityVSLoss of information

Solution Approach 1:

The patent divides data into multiple segments and stores them in different copies. Instead of storing complete identical copies, each backup copy contains segments from different original data files. This segmentation allows recovery of individual segments even when some copies are completely damaged, as long as not all segments are lost across all copies.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent changes the parameter of data organization from complete copies to segmented portions. By transforming the storage unit from whole-file copies to file segments, the system achieves better resilience against total data loss while maintaining recovery capability through segment-level operations.

Inventive Principle:
Principle #35Parameter changes

2Ease of operation

If complete copies are used as recovery units, then recovery process is simple, but recovery fails when all copies are damaged

Engineering Contradiction:
Improverecovery simplicityVSAvoidrecovery success rate
Core Design Contradiction:
Ease of operationVSReliability

Solution Approach 1:

The patent segments data into multiple parts and treats segments as the basic recovery unit. The recovery process operates at the segment level rather than requiring complete copy replacement, enabling partial recovery when some segments remain intact across damaged copies.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent implements partial recovery by recovering only the damaged segments rather than requiring complete copy replacement. This partial action approach allows recovery of usable data portions even when complete copies are unavailable, reducing the severity of data loss.

Inventive Principle:
Principle #16Partial or excessive action

3Loss of information

If data is divided into segments and stored in copies, then data can be recovered when all copies are partially damaged, but storage and management complexity increases

Engineering Contradiction:
Improvedata loss preventionVSAvoidstorage system complexity
Core Design Contradiction:
Loss of informationVSDevice complexity

Solution Approach 1:

The patent divides data into segments and distributes them across multiple copies, enabling recovery when not all segments are lost. This segmentation strategy prevents total data loss while the systematic organization keeps management complexity manageable.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent uses multiple copied segments distributed across different storage copies. By creating and managing copies of segmented data, the system achieves redundancy and recovery capability while maintaining organized storage structures that balance complexity and protection.

Inventive Principle:
Principle #26Copying

Data Source

PatentUS9983941B2Method and apparatus for recovering data
Publication Date: 2018.05.29 HUAWEI TECH CO LTD
  • US9983941B2 patent drawing
  • US9983941B2 patent drawing
  • US9983941B2 patent drawing

AI summary

In a data recovery method, there are a server and a plurality of storage devices each storing a copy of a data block. The server divides each copy of the data block into N segments corresponding to a sequence of N partitions. And then, the server constructs a plurality of different trial data blocks each including N segments corresponding to the sequence of N partitions. After that, the server calculates a check code for each trial data block, and continues to identify a trial data block having a check code identical to a pre-stored standard check code of the data block. At last, the server replaces at least one of the copies of the data block with the identified trial data block having the check code identical to the pre-stored standard check code.