Dynamic Block Segmentation for Data Transfer Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data transfer methods fail to sufficiently reduce data transfer volume when only partial differences exist in data blocks, leading to redundant transmission of entire blocks.
Innovation Solution
A method that compares initial and updated data to determine difference portions, divides data into blocks to make differences a single block, calculates and transmits hash values for each block, and receives only blocks with different hash values from the data source, allowing for dynamic adjustment of dividing positions to minimize data transfer.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the data transmission source device transmits entire blocks when hash values differ, then data integrity is ensured, but data transfer volume cannot be sufficiently reduced
Solution Approach 1:
The invention segments the data into smaller units called blocks and further divides each block into multiple segments. Instead of transmitting entire blocks when hash values differ, the system transmits only the specific segments that have changed, thereby reducing data transfer volume while maintaining data integrity through hash value verification
Solution Approach 2:
The invention extracts only the necessary changed portions (segments) from the blocks and transmits them separately. By identifying which segments have different hash values between the source device and host device, the system extracts and transmits only those specific segments rather than the entire block, reducing redundant data transmission
2Ease of manufacture
If the data is divided into fixed blocks, then data processing is simplified, but data transfer volume cannot be optimized when differences are partial
Solution Approach 1:
The invention introduces dynamic block segmentation where the dividing positions within blocks are not fixed but can be adjusted based on the actual data differences. The system dynamically determines optimal dividing positions within blocks to create segments that minimize data transfer volume while maintaining processing simplicity through automated hash value comparison
3Productivity
If hash values are calculated for entire blocks, then data comparison is efficient, but data transfer volume reduction is limited
Solution Approach 1:
The system calculates hash values for smaller segments within blocks rather than only for entire blocks. This segmentation allows for more efficient data comparison at a finer granularity, enabling the system to identify and transmit only the minimal necessary changed portions, thereby reducing data transfer volume while maintaining high comparison efficiency
Data Source
AI summary
A non-transitory computer-readable recording medium storing a program that causes a computer to execute a process, the process includes comparing first data previously acquired from a data transmission source device and second data currently acquired from the device to specify a difference portion of the second data as compared with the first data; determining a dividing position of the second data so that the difference portion is made into a single block; dividing the second data into first blocks at the dividing position; transmitting, to the device, a first hash value for each of the first blocks and information on the dividing position; and receiving, from the device, the second block corresponding to a second hash value different from the first hash value for each of the first blocks, among second blocks obtained by dividing third data held by the device based on the information on the dividing position.