Archive Paging Mechanism for Skipping Non-Archivable Objects
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Archiving systems face inefficiencies due to incorrectly labeled objects that are not allowed to be archived, leading to resource-intensive archiving processes being clogged and preventing the archiving of valid objects, resulting in a 'starvation' scenario where only a subset of eligible objects are archived.
Innovation Solution
Implementing a paging mechanism where the archiving component tracks the number of objects not allowed to be archived and adjusts the starting point of the archiving process accordingly, skipping over a determined number of oldest objects to ensure all eligible objects are eventually archived.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If the archiving component processes objects in chronological order starting from the oldest, then the archiving process is simple to implement, but incorrectly labeled objects clog the processing queue and prevent valid objects from being archived
Solution Approach 1:
The patent segments the object processing into two distinct phases: first identifying and separating incorrectly labeled objects (objects that should not be archived), then processing only the valid objects for archiving. This segmentation prevents incorrectly labeled objects from clogging the archiving queue while maintaining simple implementation through structured processing logic.
Solution Approach 2:
The patent extracts and removes incorrectly labeled objects from the archiving process before the main archiving operation. By identifying and taking out these problematic objects (objects with incorrect 'not allowed to be archived' labels), the system prevents them from blocking valid objects, thereby maintaining high archiving throughput without compromising simplicity.
2Use of energy by moving object
If the archiving component sets a limit on the number of objects to archive per request, then resource consumption is controlled, but the number of requests increases and processing time extends
Solution Approach 1:
The patent performs preliminary identification and separation of incorrectly labeled objects before the main archiving operation. By preparing and filtering the object list in advance, the system reduces the number of objects that need to be processed in subsequent requests, thereby controlling resource consumption while minimizing the increase in processing time through efficient pre-processing.
3Reliability
If the archiving component continuously processes objects without skipping any, then all objects are eventually archived, but incorrectly labeled objects waste processing resources
Solution Approach 1:
The patent extracts and removes incorrectly labeled objects from the processing stream before archiving. This ensures that only valid objects are processed for archiving, maintaining reliability by ensuring all eligible objects are archived while preventing waste of processing resources on incorrectly labeled objects that should not be archived.
Solution Approach 2:
The patent implements feedback mechanisms to track and learn from previously processed objects, particularly those that were incorrectly labeled. This feedback allows the system to refine its identification criteria and improve the separation of valid from invalid objects, thereby maintaining complete archiving of eligible objects while reducing processing resources wasted on incorrect objects.
Data Source
AI summary
A paging mechanism is provided for objects that are to be archived. An archiving component keeps track of the number of objects for which it has determined it is not allowed to archive (here called the paging amount). When a request to archive data is received by the archiving component, rather than necessarily attempt to archive the oldest objects, the archiving component instead skips a number of the oldest objects equal to the paging amount. The archiving component is invoked (e.g., each day), and then the paging amount can change based on the paging amount from the prior period (e.g., yesterday) and the newly requested objects to be archived that it determines are not allowed to be archived.