Database Sort Operation Single-Copy Storage
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current database systems incur high costs and resource consumption due to enforced data redundancy, especially in temporary tablespaces, which consume twice the disk space and bandwidth for redundant writes, and lack protection against disk failures when no redundancy is used.
Innovation Solution
Implementing a technique where results of sort operations are written as single copies without redundancy, even in redundant disk groups, with optional backup information stored redundantly, allowing for re-execution of sort operations in case of disk failure, and utilizing designated tablespaces and file identifiers for efficient storage.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If data redundancy is enforced in disk groups, then data recovery capability is improved, but resource consumption and bandwidth usage increase significantly
Solution Approach 1:
The patent applies local quality by differentiating storage policies for different types of data. Temporary data from sort operations is stored without redundancy in designated temporary tablespaces, while permanent data maintains the configured redundancy level. This localized approach optimizes resource usage for temporary operations while preserving reliability for permanent data.
Solution Approach 2:
The patent segments the database storage system into distinct tablespaces: temporary tablespaces for sort operation results and permanent tablespaces for other data. This segmentation allows independent redundancy policies for each segment, enabling temporary data to be stored efficiently without redundancy while permanent data maintains full redundancy protection.
2Reliability
If redundant copies are stored on separate failure groups, then data protection against disk failure is improved, but disk space consumption doubles
Solution Approach 1:
The patent applies local quality by differentiating storage policies for different types of data. Temporary data from sort operations is stored without redundancy in designated temporary tablespaces, while permanent data maintains the configured redundancy level. This localized approach optimizes resource usage for temporary operations while preserving reliability for permanent data.
Solution Approach 2:
The patent treats temporary sort operation results as disposable data that can be regenerated. Since sort operations can be re-executed from the original input data, the temporary results do not require persistent redundancy protection. This approach eliminates the need for expensive redundant storage for short-lived temporary data.
3Reliability
If multiple copies of data are written to maintain redundancy, then data availability is improved, but write bandwidth consumption increases
Solution Approach 1:
The patent applies local quality by differentiating storage policies for different types of data. Temporary data from sort operations is stored without redundancy in designated temporary tablespaces, while permanent data maintains the configured redundancy level. This localized approach optimizes resource usage for temporary operations while preserving reliability for permanent data.
Solution Approach 2:
The patent applies partial action by writing only a single copy of temporary sort results to designated temporary tablespaces, rather than writing multiple redundant copies. This partial approach is sufficient for temporary data since the original input data exists and can be used to regenerate results if needed, thereby reducing write bandwidth consumption.
4Reliability
If temporary tablespaces use redundancy, then protection against disk failure is improved, but performance and cost optimization is reduced
Solution Approach 1:
The patent applies local quality by differentiating storage policies for different types of data. Temporary data from sort operations is stored without redundancy in designated temporary tablespaces, while permanent data maintains the configured redundancy level. This localized approach optimizes resource usage for temporary operations while preserving reliability for permanent data.
Solution Approach 2:
The patent treats temporary sort operation results as disposable data that can be regenerated. Since sort operations can be re-executed from the original input data, the temporary results do not require persistent redundancy protection. This approach eliminates the need for expensive redundant storage for short-lived temporary data.
Data Source
AI summary
A method, computer-readable medium, and machine are provided for boosting the performance of sort operations. A database server performs an operation on a set of data. The operation uses disk space such as a temporary tablespace. The disk space belongs to a disk group in which data is stored according to a level of redundancy. A determination is made as to whether the operation is a sort operation. If the operation is not a sort operation, then at least part of a result of the operation is stored on the disk space according to the level of redundancy specified for the disk group. If the operation is a sort operation, then only a single copy of the at least part of the result is stored without storing a redundant copy of the at least part of the result. Optionally, backup information sufficient to re-perform the sort operation may also be stored.