File Tiering Hash Verification Before Cloud Stub Creation

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current file tiering processes fail to ensure data integrity during the transfer of files to cloud storage, leading to potential data corruption and loss once the original file is deleted from the source storage location.

Innovation Solution

A method involving computing a first hash value for files to be tiered, comparing it with a second hash value computed from the data in the cloud storage location, and only proceeding with tiering if the hash values match, thereby ensuring data integrity by preventing the creation of stub files for corrupted data.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If file tiering is performed without data integrity verification, then storage space on primary file system is freed and files are moved to cloud storage, but data corruption occurs and data loss happens when original file is deleted

Engineering Contradiction:
Improvestorage space utilizationVSAvoiddata integrity
Core Design Contradiction:
ProductivityVSReliability

Solution Approach 1:

The patent computes a first hash value for the file before tiering to cloud storage. This preliminary action creates a reference fingerprint of the original data that will be used later to verify data integrity, preventing data loss by detecting corruption before the original file is deleted.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent implements a feedback mechanism by computing a second hash value from the tiered file in cloud storage and comparing it with the first hash value. This feedback loop verifies whether the tiered data matches the original data, ensuring data integrity before the tiering operation is considered complete.

Inventive Principle:
Principle #23Feedback

2Reliability

If hash value verification is performed before tiering, then data integrity is ensured, but additional processing time and computational overhead are introduced

Engineering Contradiction:
Improvedata integrityVSAvoidtiering operation time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The first hash value is computed during the file tiering process itself, before the original file is deleted. This preliminary computation integrates verification into the existing workflow rather than adding separate verification steps, minimizing additional time overhead.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent uses hash values (cryptographic parameters) to represent file content for comparison purposes. This parameter transformation allows efficient verification of data integrity through mathematical computation rather than byte-by-byte comparison, reducing processing time while maintaining reliability.

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS12596680B2File tiering with data integrity checks
Publication Date: 2026.04.07 DELL PROD LP
  • US12596680B2 patent drawing
  • US12596680B2 patent drawing
  • US12596680B2 patent drawing

AI summary

A method comprises computing a first hash value for at least one file of a plurality of files to be tiered in connection with a file tiering operation of the plurality of files from a source storage location to a destination storage location, wherein the file tiering operation comprises tiering of the at least one file to the destination storage location. In the method, the first hash value is compared to a second hash value for the at least one file, wherein the second hash value is computed from data in an object on the destination storage location corresponding to the at least one file. Based at least in part on the comparing, a determination is made whether the first hash value is the same as the second hash value. The tiering of the at least one file to the destination storage location proceeds in response to an affirmative determination.