Data Object Version Retention via Temporal Key Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
It is challenging to configure network-based storage services to enforce user-specified policies for the retention of data object versions in a computationally efficient manner, especially in large-scale storage environments where temporal limits on version retention need to be managed effectively.
Innovation Solution
The solution involves assigning keys to data object versions that reflect their temporal characteristics, allowing for efficient ordering and evaluation of eligibility criteria for retention policies. These keys enable the storage service to determine when versions should be deleted or moved based on specified temporal limits, implementing a temporal recycle bin model that ensures data management is both efficient and compliant with user-defined policies.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If user-specified policies for retention of data object versions are enforced in large-scale storage services, then data retention compliance is improved, but computational efficiency deteriorates
Solution Approach 1:
The patent segments the version retention policy into two independent components: a temporal policy component that determines which versions are eligible for deletion based on time-based criteria, and a criteria-based policy component that evaluates additional conditions. This segmentation allows the system to pre-process and filter versions using the temporal component before applying the more computationally intensive criteria-based evaluation, thereby improving overall computational efficiency while maintaining policy compliance.
Solution Approach 2:
The patent implements preliminary action by maintaining a temporal policy that pre-determines version eligibility for deletion based on temporal criteria before the actual deletion decision is made. This preliminary temporal filtering reduces the search space and computational burden of the subsequent criteria-based evaluation, enabling efficient enforcement of retention policies in large-scale storage services.
2Quantity of substance
If temporal limits on version retention are enforced, then storage overhead is reduced, but system complexity increases
Solution Approach 1:
The patent segments the retention policy system into distinct functional components: a temporal policy module that manages time-based retention limits, and a criteria-based policy module that handles additional deletion conditions. This segmentation isolates the temporal limit enforcement logic from the broader criteria evaluation, making the system easier to manage and maintain while effectively reducing storage overhead through automated version deletion.
Data Source
AI summary
A method and apparatus for criterion-based retention of data object versions are disclosed. In the method and apparatus, a plurality of keys are sorted in accordance with an ordering scheme, whereby a key of the plurality of keys has an associated version of a data object and a timestamp. The key is inspected in accordance with the ordering scheme to determine based at least in part on the timestamp whether a criterion for performing an action on the associated version of the data object is satisfied. If the criterion is satisfied, a marker key is added to the plurality of keys, whereby the marker key precedes the inspected key according to the ordering scheme and indicates that the criterion is satisfied.