Dynamic Circular Transaction Log Sizing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Previous data storage systems with fixed-sized transaction logs face delays when logs become full, as they either pause or reject write requests, and existing solutions often require costly log copying to larger sizes to avoid this issue.
Innovation Solution
A dynamic sizing technique for circular transaction logs that increases storage space at the tail and before the head in response to trigger events such as threshold fullness or changes in request rates, allowing for efficient management of log space without requiring excessive initial log sizes or costly copying.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the log size is set to a large fixed value to avoid filling up the log, then the log can accommodate more write requests without pausing or rejecting them, but the system uses an excessively large log regardless of the actual typical needs
Solution Approach 1:
The patent implements dynamic log sizing where the log capacity is not fixed but adjusts automatically based on actual usage patterns. The system monitors the rate of write requests and dynamically expands or contracts the log size, transforming the static log structure into a dynamic one that adapts to workload demands, thereby avoiding both log fullness and excessive allocation
Solution Approach 2:
The system changes the parameter of log size dynamically rather than maintaining a constant value. By monitoring write request rates and adjusting the log capacity parameter accordingly, the system optimizes the balance between having sufficient space for write operations and not allocating more space than necessary, resolving the contradiction between reliability and resource usage
2Productivity
If the log size is increased dynamically by copying contents to a larger space, then the log can resume operation without pausing write requests, but the solution involves copying log entries from the old log to the new log prior to resuming operation
Solution Approach 1:
The system performs preliminary actions by pre-allocating additional log space before it is actually needed. When the log approaches fullness, the system has already prepared expanded space, allowing for seamless transition without the need for time-consuming copying operations. This preliminary preparation eliminates the downtime associated with log expansion
Solution Approach 2:
The patent employs a copying mechanism where log entries are replicated from the original log structure to an expanded log structure. This copying approach allows the system to maintain operational continuity by having a ready-to-use expanded log space, enabling the transition from old to new log without interrupting write request processing
3Quantity of substance
If write requests are paused or rejected when the log is full, then the log size can be managed within fixed bounds, but significant delays occur for applications writing to the data storage system
Solution Approach 1:
The system transforms the static fixed-size log into a dynamic log that can expand when needed. By implementing dynamic size adjustment based on monitored write request rates, the log can grow to accommodate incoming requests without pausing or rejecting them, thereby eliminating delays while maintaining effective size management through adaptive control
Data Source
AI summary
Managing a circular transaction log in a data storage system includes receiving requests specifying data to be written to a data object served by the data storage system, and adding log entries to the log containing data specified by the requests at or after a tail of the log and before a head of the log. In response to a trigger event, a size of the log is dynamically increased by inserting additional storage space into the log at or after the tail and before the head, to account for differences between the rate at which entries are added to the log and the rate at which entries are flushed from the log. The disclosed technique may further operate to find the slot position in which each log entry is stored, based on the identifier of the log entry, after inserting the additional storage space into the log.