Trimming Unused Blocks in Versioned Image Backups
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Image backup methods often retain unused blocks in successive versions, increasing storage size and restoration processing time due to the inclusion of deleted data.
Innovation Solution
A method to identify and trim unused blocks from versioned image backups in sparse storage by comparing allocation sets across different backup versions, ensuring only allocated blocks are retained.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If image backup retains all allocated blocks from source storage, then backup completeness is improved, but storage size increases due to inclusion of unused blocks
Solution Approach 1:
The patent extracts and removes unused blocks from the backup image by comparing the current allocation map with previous backup allocation maps. Blocks that are no longer allocated in the source storage are identified and trimmed from the backup, maintaining only the necessary allocated blocks while removing redundant data that increases storage size.
Solution Approach 2:
The patent changes the state of backup blocks from a static retention of all allocated blocks to a dynamic state where block retention is determined by comparing allocation states across different time points. This parameter change enables the system to distinguish between currently used and previously used blocks, allowing selective retention of only necessary blocks.
2Manufacturing precision
If image backup includes all allocated blocks, then restoration accuracy is improved, but processing time increases due to unnecessary data
Solution Approach 1:
The patent extracts unused blocks from the backup image by comparing allocation maps, removing redundant data that would otherwise be processed during restoration. This extraction maintains restoration accuracy for all currently allocated blocks while eliminating unnecessary processing of deleted blocks, thereby reducing processing time.
Solution Approach 2:
Instead of processing all blocks in the backup image during restoration, the patent applies partial action by identifying and processing only the blocks that are currently allocated in the source storage. This selective processing approach maintains restoration accuracy for necessary blocks while reducing overall processing time by excluding unused blocks.
3Reliability
If successive backup versions retain all blocks, then version completeness is improved, but storage efficiency deteriorates due to redundant unused blocks
Solution Approach 1:
The patent extracts and removes unused blocks from successive backup versions by comparing allocation maps across versions. This extraction maintains version completeness for all blocks that were allocated at any point in time while removing redundant unused blocks that waste storage space, thereby improving storage efficiency without sacrificing the ability to restore any historical version.
Solution Approach 2:
The patent changes the storage efficiency parameter by dynamically managing block retention in backup versions. By comparing allocation states across different time points and selectively retaining only blocks that were allocated, the system transforms the storage structure from containing all possible blocks to containing only necessary blocks, improving storage efficiency while maintaining version completeness.
Data Source
AI summary
Trimming unused blocks from a versioned image backup of a source storage that is stored in a sparse storage. In one example embodiment, a method may include identifying a versioned image backup that is stored in a sparse storage. The sparse may store first and second versions of the versioned image backup representing states of the source storage at successive first and second points in time, respectively. The method may further include deleting the first version, identifying a first set of blocks that were allocated in the source storage at the second point in time, identifying a second set of blocks that are allocated in the sparse storage for the second version, determining a third set of blocks that are included in the second set of blocks but are not included in the first set of blocks, and trimming the third set of blocks from the second version.