Database Row Page Compression Bitmap Dictionary
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current data compression techniques in relational database systems, such as row level and page level compression, are inefficient and do not adequately address the growing data storage needs, leading to a need for improved compression methods that do not introduce new overhead.
Innovation Solution
The proposed solution involves identifying fixed-length data candidates in database rows and pages based on predetermined thresholds, using bitmaps for row-level compression and page dictionaries to reduce storage requirements by eliminating redundancy, and applying both row and page boundary compression techniques to achieve optimal data storage efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If row level compression and page level compression are used, then data storage capacity is improved, but compression efficiency remains insufficient and does not adequately address growing data storage needs
Solution Approach 1:
The patent segments the database into multiple partitions, with each partition independently applying compression techniques. This allows different compression strategies to be applied to different data segments based on their characteristics, improving overall compression efficiency while maintaining manageable complexity
Solution Approach 2:
The patent implements dynamic compression by identifying fixed-length data candidates based on predetermined thresholds and applying compression adaptively. The system dynamically determines which columns to compress based on data characteristics, rather than applying a static compression scheme to all data
2Quantity of substance
If compression techniques are applied to reduce storage requirements, then data storage efficiency is improved, but new overhead is introduced
Solution Approach 1:
The patent extracts only the necessary compression metadata (such as length information for variable-length columns) rather than storing complete compression descriptors for each column. This reduces the overhead associated with compression while maintaining the ability to decompress and access data
Solution Approach 2:
The patent applies compression selectively to only those columns that meet the predetermined threshold criteria for fixed-length data candidates, rather than compressing all columns uniformly. This partial application of compression reduces overall system overhead while achieving sufficient storage efficiency
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A system, method, and computer program product for reducing data storage requirements in a database system are described herein. An embodiment includes identifying at least one data candidate of fixed length data type in at least one row of database data for compression based upon a predetermined threshold level and a boundary of compression, providing at least one bit within the at least one row for an identified data candidate according to the boundary of compression, and storing the at least one row as compressed data in the database system. For compression based on a row boundary, the identified data candidates for compression include fixed length columns having lengths that do not fall below the predetermined threshold level in a row of data and the at least one bit comprises a bitmap for a length of the identified data candidates following compression. For compression based on a page boundary, the identified data candidates for compression include redundant byte string data in a page of data, the redundant byte string data including matching data across columns having lengths that do not exceed the predetermined threshold level.