Database Reorganization Bypassing Large Units of Work
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Fast Path databases, such as DEDBs, require frequent reorganization due to high transaction activity, which can lead to failures and outages when large database records exceed allocated buffer space, causing the reorganization process to fail and necessitating manual intervention.
Innovation Solution
The system automatically allocates buffer space and bypasses units of work (UOWs) that exceed buffer capacity by dynamically determining selection criteria based on the number of buffers needed, allowing the reorganization process to run to completion without manual intervention and keeping the database online.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If frequent reorganization is performed to maintain database performance and handle space issues, then database performance and space management are improved, but database outages and disruptions increase
Solution Approach 1:
The system performs preliminary actions by analyzing space maps and control intervals before reorganization to predict buffer space requirements. It pre-determines which units of work should be bypassed based on their buffer requirements, allowing the reorganization to proceed without unexpected failures or outages.
Solution Approach 2:
The reorganization process becomes self-managing by automatically determining buffer space requirements and selecting which units of work to bypass. The system monitors and adjusts buffer allocation dynamically during reorganization, eliminating the need for manual intervention and planned outages.
2Productivity
If buffer space is allocated to all units of work during reorganization, then complete reorganization is achieved, but reorganization failures occur when records exceed buffer capacity
Solution Approach 1:
The system applies partial action by selectively bypassing units of work that require more buffer space than is available or practically allocable. Instead of attempting to reorganize all units of work uniformly, it processes only those that can be successfully reorganized within buffer constraints, achieving partial reorganization completion without failure.
Solution Approach 2:
The system changes the parameter of buffer space allocation dynamically during reorganization. It determines the actual buffer space required for each unit of work by analyzing space maps and control intervals, then adjusts buffer allocation accordingly, bypassing only those units that cannot be accommodated within available buffer resources.
3Reliability
If manual intervention is used to manage buffer space during reorganization, then reorganization failures are addressed, but operational complexity and intervention time increase
Solution Approach 1:
The system eliminates manual intervention by implementing self-service mechanisms that automatically analyze space maps, determine buffer requirements for each unit of work, and select which units to bypass. The reorganization process manages its own resource allocation and failure prevention without human involvement.
Solution Approach 2:
The system incorporates feedback mechanisms by continuously monitoring buffer space usage and reorganization progress. It uses space maps and control interval information to adjust buffer allocation in real-time, automatically adapting to varying record sizes and buffer availability to prevent failures before they occur.
Data Source
AI summary
Described systems and techniques enable a database reorganization process to run to completion in an automated mode by dynamically and efficiently allocating buffer space and by automatically bypassing units of work (UOWs) that house larger database records whose requirements exceed the allocated or obtainable amount of buffer space. An amount of space allocated to UOWs in an overflow part of the area of the database is determined. A number of buffers required to reorganize the UOWs is determined. Selection criteria is set based on the number of buffers or a keyword command. The area of the database is reorganized using the selection criteria including bypassing the UOWs that do not meet the selection criteria.