Backup Data Stream Partitioning for Fixed-Position Delta Reduction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The fixed position delta reduction backup method inefficiencies arise from data insertion and deletion characteristics in systems with concatenated logical partitions of data blocks, leading to unnecessary data storage and transmission, particularly in database applications.
Innovation Solution
Modifying the backup data stream by separating it into logical components and inserting temporary data blocks for missing blocks to align data properly before processing, thereby minimizing detected changes and reducing unnecessary data storage.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If data blocks are inserted or deleted from a data stream, then the data stream structure is updated to reflect current data state, but all subsequent data blocks appear as new or modified data requiring unnecessary storage
Solution Approach 1:
The patent divides the data stream into fixed-position segments or blocks, where each segment is independently processed for delta reduction. This segmentation allows the system to identify changes at specific segment boundaries rather than treating the entire stream as one continuous sequence, thereby isolating the impact of insertions and deletions to specific segments only.
Solution Approach 2:
The patent performs preliminary processing of the data stream by inserting placeholder blocks or maintaining fixed-position structure before the delta reduction comparison. This preliminary action ensures that subsequent blocks maintain their expected positions, allowing the fixed position delta reduction algorithm to correctly identify only actual changes rather than positional shifts.
2Loss of substance
If fixed position delta reduction is applied to concatenated logical partitions, then backup space is reduced by identifying unchanged segments, but data insertion and deletion cause false detection of new data increasing storage requirements
Solution Approach 1:
The patent changes the parameter of data block positioning from variable to fixed, establishing a predetermined position for each logical partition or data block within the stream. This parameter change allows the system to compare data at identical positions across backups, accurately detecting only true modifications rather than positional variations caused by insertions or deletions elsewhere in the stream.
3Adaptability or versatility
If data blocks are shifted due to insertion or deletion, then the data stream reflects actual data changes, but the fixed position comparison method misidentifies shifted blocks as modified data
Solution Approach 1:
The patent introduces an intermediary layer or wrapper structure that maintains fixed-position blocks around variable-content data regions. This intermediary structure acts as a buffer that absorbs the impact of data insertions and deletions, preventing them from causing positional shifts in subsequent blocks while still allowing the underlying data to be flexibly modified.
Data Source
AI summary
When a data stream is received, the data stream may be parsed into a plurality of logical components, where each of the logical components includes one or more data blocks. Missing data blocks may also be detected in the data stream, and therefore may be detected in each of the plurality of logical components. For instance, each of the logical components may be separated into a separate data stream for which missing data blocks may be detected. A temporary data block is then inserted where each missing data block is detected (e.g., in each of the plurality of logical components). In this manner, inefficiencies introduced into a fixed position delta reduction backup process as a result of new or deleted data in a system implementing a plurality of data blocks which may be stored in the form of logical components are eliminated.