Hash-Based Data Recovery in Remote Storage Systems
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Content addressable storage systems face challenges in recovering data pages with errors, especially when synchronous replication is absent, making it difficult to restore data accurately and efficiently.
Innovation Solution
Implementing a hash-based data recovery technique where a processing device detects errors in data pages, sends a hash digest to additional storage systems, and verifies the received recovery data page to ensure accuracy, allowing for efficient recovery without requiring synchronous replication.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If synchronous replication is implemented to enable data recovery, then data reliability is improved, but device complexity and loss of time increase
Solution Approach 1:
The patent extracts the essential recovery information (hash digest) from the full data page, allowing recovery requests to be processed using only this compact identifier. This eliminates the need for complex synchronous replication while maintaining recovery capability, as the hash digest can be stored and compared without replicating entire data pages across systems.
Solution Approach 2:
The system pre-computes and stores hash digests of data pages in metadata. When errors are detected, recovery can proceed by comparing these pre-stored hash digests with those of potential recovery pages, eliminating the need for complex real-time replication verification and accelerating the recovery process.
2Reliability
If synchronous replication is implemented to enable data recovery, then data reliability is improved, but loss of time increases
Solution Approach 1:
By extracting and using only the hash digest (a compact identifier) rather than full data pages for recovery matching, the system dramatically reduces data transmission and processing time. The recovery process compares small hash values instead of large data pages, enabling rapid identification of suitable recovery pages without the time overhead of synchronous replication.
Solution Approach 2:
Hash digests are pre-computed and stored in metadata before any errors occur. During recovery, these pre-existing hash digests enable immediate comparison and matching operations, eliminating the time required for real-time data page verification and accelerating the overall recovery process.
3Device complexity
If hash-based recovery is implemented without synchronous replication, then device complexity is reduced, but measurement precision of data integrity verification must be maintained
Solution Approach 1:
The patent replaces complex mechanical replication verification systems with a cryptographic hash-based verification mechanism. Instead of comparing entire data pages or maintaining complex replication state machines, the system uses hash digest comparison to verify data integrity, achieving high precision verification with minimal complexity.
Solution Approach 2:
The system transforms the verification problem from comparing large data pages (high complexity, high precision) to comparing compact hash digests (low complexity, high precision). This parameter transformation maintains verification accuracy while dramatically reducing the computational and storage resources required.
Data Source
AI summary
An apparatus in one embodiment comprises at least one processing device comprising a processor coupled to a memory. The processing device is configured to detect an error relating to storage of a given data page in a first storage system, and to send a message to at least one additional storage system, the message containing a hash digest of the given data page. The processing device is further configured to receive from the additional storage system responsive to the message a recovery data page identified by the additional storage system as having the same hash digest as the given data page. The recovery data page received from the additional storage system is verified by computing a hash digest of the recovery data page and comparing the computed hash digest to the hash digest of the given data page. Separate instances of the message containing the hash digest of the given data page may be sent to each of a plurality of additional storage systems.