Data Chunk Boundary Selection Using Character Distribution

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

The fixed size chunking algorithm in data deduplication is affected by boundary offsets, leading to poor chunking efficiency and deduplication effects due to its inability to adapt to varying data distribution characteristics.

Innovation Solution

A chunking method that determines data distribution characteristics based on character values in a data segment, allowing for adaptive chunking positions that improve deduplication efficiency by grouping characters with similar values together, thereby enhancing deduplication rates and reducing power consumption.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If a fixed size chunking algorithm is used, then the chunking process is simple and fast, but the deduplication effect deteriorates due to boundary offset issues

Engineering Contradiction:
Improvechunking speedVSAvoiddeduplication accuracy
Core Design Contradiction:
ProductivityVSReliability

Solution Approach 1:

The patent implements dynamic chunking by adjusting chunk boundaries based on data distribution characteristics. Instead of using fixed-size chunks, the system dynamically determines chunk boundaries by analyzing character value distributions and identifying optimal split points that maximize deduplication effectiveness while adapting to different data patterns.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent changes the parameter of chunk size from fixed to variable based on data characteristics. By introducing parameters such as character value thresholds, distribution patterns, and boundary offset adjustments, the system transforms the rigid fixed-size chunking approach into a flexible variable-size approach that adapts to different data scenarios.

Inventive Principle:
Principle #35Parameter changes

2Ease of manufacture

If the fixed size chunking algorithm is used, then the implementation is straightforward, but the adaptability to different data distribution characteristics deteriorates

Engineering Contradiction:
Improvealgorithm implementation simplicityVSAvoiddata distribution adaptability
Core Design Contradiction:
Ease of manufactureVSAdaptability or versatility

Solution Approach 1:

The patent segments the data processing into distinct phases: data distribution analysis, characteristic identification, boundary determination, and chunking execution. This segmentation allows the system to first analyze data characteristics and then apply appropriate chunking strategies, improving adaptability while maintaining implementation clarity through structured processing steps.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent performs preliminary analysis of data distribution characteristics before executing the chunking operation. By pre-processing the data to identify patterns, boundaries, and optimal split points, the system prepares the necessary information in advance, enabling adaptive chunking without significantly increasing overall complexity.

Inventive Principle:
Principle #10Preliminary action

3Reliability

If boundary offsets occur due to data insertion or deletion, then the fixed size chunking algorithm cannot detect duplicate chunks, but increasing chunk size analysis complexity increases processing overhead

Engineering Contradiction:
Improveduplicate detection accuracyVSAvoidchunking algorithm complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent implements feedback mechanisms where the chunking process continuously monitors data distribution patterns and adjusts boundary positions accordingly. By using feedback from data characteristic analysis to refine chunk boundaries, the system maintains high duplicate detection accuracy while avoiding excessive complexity through iterative optimization rather than complex upfront calculations.

Inventive Principle:
Principle #23Feedback

Solution Approach 2:

The patent enables the chunking algorithm to self-adjust boundaries based on inherent data characteristics without requiring external intervention or complex configuration. The system automatically identifies optimal split points by analyzing its own data patterns, reducing the need for complex external control mechanisms while maintaining high detection accuracy.

Inventive Principle:
Principle #25Self-service

Data Source

PatentUS11755540B2Chunking method and apparatus
Publication Date: 2023.09.12 HUAWEI TECH CO LTD
  • US11755540B2 patent drawing
  • US11755540B2 patent drawing
  • US11755540B2 patent drawing

AI summary

Embodiments of this application disclose a chunking method and an apparatus for implementing the method. According to the method provided in the embodiments of this application, a first data segment of a first length may be determined starting from a header of a to-be-chunked data flow, a data distribution characteristic of the first data segment is determined based on character values of all characters in the first data segment, and then a chunking position is determined for different data distribution characteristics by using different methods. In this way, a data flow can be better chunked, so as to enhance a deduplication effect.