Data Chunk Replication Using Fingerprint Delta Transfer

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing data storage systems face inefficiencies in replicating data across storage nodes, particularly due to the high volume of data that needs to be transferred, which can be time-consuming over slower network links, and the need to transfer entire chunks instead of incremental changes.

Innovation Solution

The system computes and stores fingerprints for each data chunk, allowing it to identify similar chunks and transmit only the delta between them, enabling the target node to reconstruct the requested chunk efficiently by using a fingerprint index to select the chunk with the highest frequency of occurrence and transmit an identifier along with the delta.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If entire data chunks are transferred during replication, then data completeness is ensured, but transfer time increases significantly

Engineering Contradiction:
Improvedata completenessVSAvoidtransfer time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The patent extracts and transfers only the differential portions (deltas) of changed data between chunks rather than transferring entire chunks. By identifying and isolating only the modified data segments, the system reduces transfer volume while ensuring data completeness through selective transmission of necessary changes.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The patent segments data into chunks and further divides changed portions into differential segments. By breaking down entire chunks into smaller differential components, the system enables selective transfer of only the necessary modified portions, reducing overall transfer time while maintaining data integrity.

Inventive Principle:
Principle #1Segmentation

2Quantity of substance

If data deduplication is implemented, then storage efficiency improves, but the complexity of data management increases

Engineering Contradiction:
Improvestorage efficiencyVSAvoiddata management complexity
Core Design Contradiction:
Quantity of substanceVSDevice complexity

Solution Approach 1:

The patent uses fingerprint copying to identify and reference identical or similar data chunks across different locations. By creating and storing fingerprint representations of data chunks, the system enables efficient deduplication through reference copying rather than physical duplication, improving storage efficiency while managing complexity through standardized fingerprinting mechanisms.

Inventive Principle:
Principle #26Copying

3Quantity of substance

If variable chunk sizes are used, then data compression efficiency improves, but the complexity of chunk identification and matching increases

Engineering Contradiction:
Improvedata compression efficiencyVSAvoidchunk identification complexity
Core Design Contradiction:
Quantity of substanceVSDifficulty of detecting and measuring

Solution Approach 1:

The patent changes the parameter of chunk size from fixed to variable, allowing chunks to be sized according to actual data boundaries and similarity patterns. This enables better compression efficiency by adapting chunk sizes to data characteristics, while fingerprinting techniques simplify the identification and matching process despite the variability in size.

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS10146787B2Transferring differences between chunks during replication
Publication Date: 2018.12.04 QUEST SOFTWARE INC
  • US10146787B2 patent drawing
  • US10146787B2 patent drawing
  • US10146787B2 patent drawing

AI summary

Techniques and mechanisms described herein facilitate the replication of data between storage nodes. According to various embodiments, a request to provide a data chunk to a target storage node may be received at a source data storage node. A reference data chunk may be identified based on fingerprint information associated with the requested data chunk. The reference data chunk may be stored on the target storage node. The reference data chunk and the requested data chunk may each include a first data portion. Data chunk reconstruction information may be transmitted from the source data storage node to the target data storage node. The data chunk reconstruction information may identify the reference data chunk. The data chunk reconstruction information may include data difference information for constructing the requested data chunk at the target data storage node based on the reference data chunk.