Storage Journal Log Reduction Through Latest-Write Retention
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The size of journal logs in storage systems increases over time, limiting the amount of data that can be protected due to storage space constraints, and existing methods for reducing their size often result in the loss of useful information.
Innovation Solution
A method to reduce the size of journal logs by identifying suitable target segments, determining the most recent write operations for each modified storage location, and generating a new segment that includes only these entries, ordered by storage address, thereby deleting superseded writes without losing useful information.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If journal log size increases to protect more data, then data protection capability is improved, but storage space is consumed
Solution Approach 1:
The patent extracts only the essential journal entries needed for data recovery by identifying and retaining only the most recent write operation for each storage location. This removes redundant superseded writes while preserving the minimum necessary information for complete data reconstruction, thereby reducing storage space consumption while maintaining data protection capability.
Solution Approach 2:
The patent changes the parameter of journal log organization by sorting entries according to storage address order rather than chronological order. This parameter change enables more efficient space utilization by allowing compact representation of journal data while maintaining the ability to reconstruct original data sequences for recovery operations.
2Quantity of substance
If journal log is reduced by deleting old entries, then storage space is saved, but useful information may be lost
Solution Approach 1:
The patent implements a feedback mechanism by analyzing the relationships between journal entries and identifying which entries are superseded by more recent writes to the same storage locations. This feedback loop ensures that only redundant information is removed while preserving all necessary data for recovery, preventing loss of useful information.
Solution Approach 2:
The patent selectively discards superseded journal entries that are no longer needed for data recovery, while preserving the essential most recent write operations. This selective discarding process reduces storage space while ensuring that all recoverable information is maintained through the preservation of non-superseded entries.
3Stability of the object's composition
If journal entries are kept in chronological order, then data recovery sequence is maintained, but data recovery speed is reduced
Solution Approach 1:
The patent inverts the traditional chronological ordering approach by organizing journal entries according to storage address order. This inversion allows the recovery system to process entries in a more efficient spatial sequence that matches the physical storage layout, thereby improving data recovery speed while maintaining the ability to reconstruct the correct temporal sequence of operations through the preserved most recent write information.
Data Source
AI summary
Example implementations relate to data storage. An example includes detecting a trigger event for a reduction operation of a journal log, and in response selecting a set of target segments in the journal log. The example also includes determining a set of storage locations that were modified by write operations recorded in the set of target segments, and identifying a subset of journal entries in the set of target segments, where each journal entry of the subset of journal entries records a most recent write operation recorded for a different storage location of the set of storage locations. The example also includes generating a new segment including the identified subset of journal entries, and replacing the set of target segments with the generated new segment.