Compression Rule Recommendation for Faster Database Data Compression
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current data compression technologies in relational databases face challenges in efficiently selecting and detecting optimal compression coding rules, leading to high computation costs and increased complexity as data ranges expand, especially in row-column hybrid compression methods.
Innovation Solution
A data compression method that utilizes a recommendation record to store historical compression coding rules and their corresponding rates, allowing for direct selection of suitable coding rules for similar objects, thereby reducing the need for repeated computation and improving compression efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If multiple compression coding rules are evaluated and selected through precomputation and matching comparisons, then compression efficiency is improved, but computation cost and system complexity increase
Solution Approach 1:
The patent applies preliminary action by precomputing compression rates for multiple compression coding rules during an initialization phase and storing them in a lookup table. When compression is needed, the system simply retrieves precomputed values based on data characteristics rather than performing real-time computation, thus improving compression efficiency while avoiding the complexity of dynamic rule selection
Solution Approach 2:
The patent creates a copy of compression rate information in a lookup table that can be quickly queried. Instead of repeatedly computing compression rates, the system copies precomputed values into a readily accessible structure, allowing fast retrieval and comparison without reperforming the computationally intensive analysis
2Manufacturing precision
If multiple compression coding rules are evaluated through extensive precomputation and matching comparisons, then optimal compression is achieved, but time consumption increases
Solution Approach 1:
The patent performs compression rate precomputation in advance and stores results in a lookup table. During actual compression operations, the system retrieves precomputed values instantaneously rather than performing time-consuming calculations, thus achieving optimal compression selection without the time penalty of extensive real-time computation
Solution Approach 2:
The patent implements a dynamic lookup mechanism that adapts to different data characteristics. The system maintains a lookup table that can be queried based on varying data types and compression requirements, providing fast access to optimal compression rules without requiring time-intensive reevaluation for each compression task
Data Source
Figure 1~2
Figure 3~4
AI summary
Implementations of the present specification provide a data compression method and apparatus, and a computer device. The method includes: obtaining a to-be-compressed object; searching a recommendation record for whether a recommended compression coding rule that meets a compression rate condition exists, the recommendation record being used to record a compression coding rule of a historical compressed object and corresponding compression rate information, and the historical compressed object being of the same type as the to-be-compressed object; and if the recommended compression coding rule that meets the compression rate condition exists, compressing the to-be-compressed object by using the recommended compression coding rule; or if the recommended compression coding rule that meets the compression rate condition does not exist, starting a regular compression coding process to obtain estimated compression rates of a plurality of compression coding rules on the to-be-compressed object, selecting a target compression coding rule based on at least the estimated compression rates, and compressing the to-be-compressed object by using the target compression coding rule.