Database Compression for Field Combinations
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing database compression techniques are inefficient as they either consume excessive disk space with metadata or neglect the varying access frequencies and compressibility of different columns, leading to suboptimal performance.
Innovation Solution
Identify frequently accessed combinations of fields in a database record, reorganize them to be stored contiguously, and apply a compression scheme tailored to these combinations to reduce storage size and CPU resources during compression and decompression.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Volume of stationary object
If compression techniques are applied to database tables or indexes, then disk space is reduced, but a compression dictionary must be stored for decompression which compromises the disk space saving benefit
Solution Approach 1:
The patent extracts only the essential compression information needed for frequently accessed column combinations and stores it in a compact format within the table structure itself, rather than maintaining a separate comprehensive compression dictionary. This selective extraction reduces the overhead while preserving decompression capability for the most important data access patterns.
Solution Approach 2:
The patent applies different compression strategies to different column combinations based on their access frequencies and compressibility characteristics. Frequently accessed combinations receive optimized compression with minimal overhead, while less critical columns use simpler or no compression, creating local quality variations that optimize overall system performance.
2Ease of manufacture
If compression is applied uniformly to all columns, then implementation is simple, but it neglects varying access frequencies and compressibility of different columns leading to suboptimal performance
Solution Approach 1:
The patent segments columns into different groups based on their access frequencies and compressibility characteristics. It identifies frequently accessed column combinations and applies targeted compression strategies to these segments, while other columns may use different or no compression. This segmentation enables the system to achieve high compression efficiency for critical data without the complexity of uniformly optimizing all columns.
3Ease of operation
If compression dictionary is stored for decompression, then data can be decompressed, but the disk space saving benefit is compromised by the metadata overhead
Solution Approach 1:
The patent performs preliminary analysis to identify frequently accessed column combinations and pre-computes compression schemes for these specific combinations. The compression information is prepared in advance and stored in a space-efficient manner that requires minimal overhead during decompression operations, thus maintaining ease of operation while minimizing the space cost.
Data Source
AI summary
This disclosure provides a computer-implemented method, a computer system and a computer program product for database compression oriented to combinations of fields of a database record. One or more combinations of fields of a record of a database are determined that satisfy a frequency criterion indicating that access frequencies of the one or more combinations of fields are higher than an access frequency threshold. The record is reorganized based on the one or more combinations of fields to store fields of each combination of the one or more combinations of fields in a respective contiguous storage space. The reorganized record is compressed by applying a compression scheme to the one or more combinations of fields.