Patching Multi-Level Data Containers Using Metadata Tree Structures
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for patching multi-level data containers require unarchiving all levels, which is time-consuming and resource-intensive, especially when applying multiple patches.
Innovation Solution
A patch tool that uses metadata to form a tree structure, allowing only required archives to be unarchived, reducing resource usage and processing time by determining the necessary archives and containers based on hierarchical paths for targeted patching operations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If all levels of multi-level data containers are unarchived to apply patches, then complete access to all files is achieved, but processing time and resource consumption increase significantly
Solution Approach 1:
The patent segments the multi-level data container structure into hierarchical levels and identifies only the specific segments (archives at required levels) that contain the target files needing patches. This segmentation allows the system to process only necessary portions rather than unarchiving entire container hierarchies, directly reducing processing time while maintaining reliable patch application to all required files.
Solution Approach 2:
The patent applies local quality by determining the specific quality requirement (access level) needed for each archive in the hierarchy. Instead of uniformly unarchiving all levels, the system identifies and processes only those archives at specific levels that contain or are ancestors of the target files, applying patches locally where needed rather than globally across the entire container structure.
2Reliability
If all levels of multi-level data containers are unarchived to apply patches, then complete access to all files is achieved, but resource consumption increases significantly
Solution Approach 1:
The patent segments the multi-level data container structure into hierarchical levels and identifies only the specific segments (archives at required levels) that contain the target files needing patches. This segmentation allows the system to process only necessary portions rather than unarchiving entire container hierarchies, directly reducing processing time while maintaining reliable patch application to all required files.
Solution Approach 2:
The patent applies local quality by determining the specific quality requirement (access level) needed for each archive in the hierarchy. Instead of uniformly unarchiving all levels, the system identifies and processes only those archives at specific levels that contain or are ancestors of the target files, applying patches locally where needed rather than globally across the entire container structure.
3Reliability
If multiple patches are applied sequentially using traditional methods, then all patches are eventually applied, but total processing time increases with each additional patch
Solution Approach 1:
The patent performs preliminary action by pre-determining the tree structure of multi-level data containers and identifying all archives at required levels before applying patches. This preliminary analysis of the container hierarchy allows subsequent patches to be applied more efficiently, as the system already knows which archives to access and can cache or reuse this structural information across multiple patch operations, reducing redundant processing.
Solution Approach 2:
The patent merges multiple patch operations by processing multiple patches against the same identified set of archives at required levels. Instead of repeatedly unarchiving and scanning the entire container hierarchy for each patch, the system combines the target file identification across multiple patches and processes them together on the already-unarchived content, significantly improving productivity when applying multiple patches.
Data Source
AI summary
A computing system provided according to an aspect of the present invention includes a developer system which sends a set of patches along with metadata in a package. The metadata may include hierarchical paths, with each path indicating a corresponding target (file or archive) which is to be replaced to apply the corresponding patch. A patch tool receives the package and applies the patches using the metadata. According to another aspect of the present invention, a patch tool forms a tree structure based on the hierarchical paths in the metadata. In an embodiment, the tree structure is traversed each time to perform a corresponding patching operation (e.g., backup, and replace). According to yet another aspect of the present invention, only the required archives are unarchived while applying the patches. In an embodiment, the patch tool determines the required archives based on the information in the received metadata.