File Repair Across Multiple Data Stores
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In a client-server scenario with multiple integrated data stores, data inconsistencies and corruption can lead to synchronization issues, requiring costly and resource-intensive complete restoration of data, which is inefficient and prone to errors.
Innovation Solution
A system that identifies inconsistencies across multiple data stores, creates a repair queue, and executes repair actions autonomously, using a persisted repair history to ensure no conflicting actions, thereby reducing the need for complete data restoration and minimizing user intervention.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If complete data restoration is performed from server to client, then data consistency is restored, but processing time and network bandwidth usage increase significantly
Solution Approach 1:
The patent segments the data restoration process by identifying and repairing only the specific corrupted file or file portion rather than restoring complete data sets. The system divides the restoration task into targeted repair operations based on corruption detection, allowing selective recovery of affected data segments while leaving intact data untouched.
Solution Approach 2:
The patent extracts and isolates the specific corrupted data elements from the larger data set for targeted repair. By identifying corrupted files through checksum validation and extracting only those specific files for repair, the system avoids the overhead of processing and transmitting entire data sets, reducing network bandwidth consumption and processing time.
2Reliability
If complete data restoration is performed from server to client, then data consistency is restored, but network bandwidth usage increases significantly
Solution Approach 1:
The patent segments the data restoration process by identifying and repairing only the specific corrupted file or file portion rather than restoring complete data sets. The system divides the restoration task into targeted repair operations based on corruption detection, allowing selective recovery of affected data segments while leaving intact data untouched.
Solution Approach 2:
The patent extracts and isolates the specific corrupted data elements from the larger data set for targeted repair. By identifying corrupted files through checksum validation and extracting only those specific files for repair, the system avoids the overhead of processing and transmitting entire data sets, reducing network bandwidth consumption and processing time.
3Productivity
If automated repair actions are executed, then repair efficiency increases, but risk of conflicting repair actions increases
Solution Approach 1:
The patent implements preliminary actions by creating a repair queue that plans and schedules repair operations before execution. The system performs pre-requisite checks and validates repair actions in advance, organizing them in a structured queue that prevents conflicting operations. This preliminary planning ensures that repair actions are coordinated and executed in the correct sequence, maintaining reliability while achieving automation.
Solution Approach 2:
The patent implements feedback mechanisms by monitoring the execution status of repair actions and updating the repair queue accordingly. The system tracks which repairs have been completed, which are pending, and which require re-evaluation, using this feedback to prevent conflicting actions and ensure repair accuracy. The feedback loop maintains system reliability through continuous validation and status tracking.
Data Source
AI summary
Non-limiting examples of the present disclosure describe file repair of a file stored across multiple data stores. An inconsistency associated with a file stored across two or more data stores on a client device is identified. A repair action is determined from a plurality of different repair actions based on attributes associated with the inconsistency identified. A repair queue entry is created in a persisted repair queue, the repair queue entry used for execution of the repair action. The repair action is executed as scheduled within the persisted repair queue when pre-requisite checks are satisfied and a persisted repair history for execution of repair actions indicates that no conflicting repair action exists. The persisted repair history and the persisted repair queue are updated based on the execution of the repair action. Other examples are also described.


