Data Disaster Tolerance via Primary Index Recovery

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing data storage systems face challenges in completely recovering index information when node failures occur, leading to potential data loss and inaccessibility, especially when multiple consecutive nodes go offline.

Innovation Solution

A method and system for data disaster tolerance where each node stores primary indexes backed up on at least two consecutive successors, with a node management apparatus detecting failure nodes and instructing effective nodes to perform a primary index recovery process, ensuring recovery into the first effective successor node, regardless of the number of failure nodes.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If backups are stored on only one successor node, then storage space is optimized, but reliability deteriorates when multiple consecutive nodes fail

Engineering Contradiction:
Improvedata recovery capabilityVSAvoidbackup storage structure
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent segments the backup storage function by distinguishing between primary index backups and secondary index backups, storing them on different successor nodes. This segmentation allows the system to maintain reliability for primary data recovery while separately managing secondary index recovery, thus resolving the contradiction between reliability and complexity.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent implements preliminary action by pre-storing both primary index backups and secondary index backups on different successor nodes before failures occur. When node failures happen, the system can immediately retrieve backups without needing to reconstruct or regenerate them, ensuring reliable recovery while maintaining a manageable backup structure.

Inventive Principle:
Principle #10Preliminary action

2Loss of information

If index information is not fully recovered after node failure, then recovery speed is fast, but data completeness deteriorates

Engineering Contradiction:
Improveindex information completenessVSAvoidrecovery time
Core Design Contradiction:
Loss of informationVSLoss of time

Solution Approach 1:

The patent applies the copying principle by creating and storing duplicate copies of index information in two separate locations (primary index backup on one successor node and secondary index backup on another successor node). This ensures that even if one copy is lost due to node failure, the other copy remains available for complete and rapid recovery.

Inventive Principle:
Principle #26Copying

3Extent of automation

If manual intervention is required for index recovery, then recovery accuracy is high, but automation level deteriorates

Engineering Contradiction:
Improveautomatic recovery capabilityVSAvoidrecovery accuracy
Core Design Contradiction:
Extent of automationVSReliability

Solution Approach 1:

The patent implements self-service by enabling the storage system to automatically detect node failures, locate appropriate backup indexes, and restore index information without human intervention. The system autonomously manages the entire recovery process, maintaining high reliability through automated consistency checks and verification procedures.

Inventive Principle:
Principle #25Self-service

Data Source

PatentUS8775859B2Method, apparatus and system for data disaster tolerance
Publication Date: 2014.07.08 HUAWEI TECH CO LTD
  • US8775859B2 patent drawing
  • US8775859B2 patent drawing
  • US8775859B2 patent drawing

AI summary

A method, apparatus and system for data disaster tolerance are provided in embodiments of this disclosure, the method comprising: receiving node failure information from a node; detecting along a predecessor direction and a successor direction of a failure node indicated in the node failure information according to a pre-stored node sequence to determine a first effective predecessor node and a first effective successor node, and all failure nodes between the first effective predecessor node and the first effective successor node; instructing those of all effective nodes that have local content registration index stored on the failure nodes and the first effective successor node to perform a primary index recovery process, respectively, so as to recover primary indexes of all of the failure nodes into the primary index of the first effective successor node.