Bit-Shift Differential Data Creation for Smaller Delta Updates
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing technologies for creating differential data to generate new data from old data by shifting bits rather than bytes result in increased additional data, reducing the effectiveness of reducing differential data size when copy data decreases.
Innovation Solution
A differential data creating apparatus and method that shifts old and new data bit strings by 0 to n bits, extracts common and additional bit strings, and generates differential data based on these shifts to increase copy bit strings and reduce additional bit strings.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If data is compared in terms of byte to extract differential data, then copy data can be extracted effectively, but when bits are shifted by insertion data, all bytes appear different causing copy data to decrease and additional data to increase
Solution Approach 1:
The patent segments the comparison process into multiple stages: first comparing bytes to identify obvious differences, then performing bit-level shifting comparisons (shifting by 1 bit, 2 bits, etc.) to detect copy data that has been shifted due to insertion operations. This segmentation allows the system to handle both byte-aligned and bit-shifted scenarios effectively.
Solution Approach 2:
The patent performs multiple rounds of comparison with increasing shift amounts (1 bit, 2 bits, 3 bits, etc.), going beyond the minimal necessary action. By performing excessive bit-shifting comparisons, the system ensures that copy data shifted by any amount can be detected, and the results are then synthesized to extract the maximum possible copy data.
2Quantity of substance
If bit shifting is performed to detect copy data, then copy bit strings increase, but the complexity of the comparison process increases
Solution Approach 1:
The patent adds a new dimension to the comparison process by introducing bit-level shifting operations beyond traditional byte-level comparison. Instead of only comparing data at byte boundaries, the system compares data shifted by various bit amounts, effectively adding a 'shift amount' dimension to the comparison space. This allows detection of copy data that has been inserted or shifted at the bit level.
Solution Approach 2:
The patent creates multiple shifted versions of the data (shifting by 1 bit, 2 bits, 3 bits, etc.) and compares each shifted version against the original data. By copying and shifting the data multiple times, the system can detect copy data regardless of the shift amount, and then synthesize these results to extract the comprehensive copy bit strings.
3Ease of operation
If only byte-level comparison is performed, then the process is simple, but copy data shifted by bit insertion cannot be detected
Solution Approach 1:
The patent performs a preliminary byte-level comparison first to quickly identify obvious differences and establish a baseline. This preliminary action filters out clearly different bytes, and then the system performs more complex bit-level shifting comparisons only on the remaining ambiguous regions, combining the simplicity of byte comparison with the accuracy of bit-level detection.
Data Source
AI summary
The present invention aims to provide a technology capable of enhancing the effect of reducing differential data in size. A bit shift unit shifts either of old data and new data in a forward direction and a backward direction of its bit string by each of 0, 1, 2, . . . , and n bit(s) to generate a plurality of data. A copy bit string extracting unit extracts information on copy bit strings based on the plurality of data and other non-shifted data. An additional bit string extracting unit excludes copy bit strings from the new data to extract information on additional bit strings. A differential data generating unit creates differential data based on the information on copy bit strings and the information on additional bit strings.