Database Sub-segments for Access-Adaptive Storage Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional database segments face inefficiencies due to fragmentation and the inability to apply optimal compression techniques based on varying access frequencies of records within a single segment.
Innovation Solution
The implementation of sub-segments within database segments allows for dynamic partitioning of records based on access frequencies, enabling each sub-segment to employ its own storage optimization techniques, such as different compression methods, to optimize storage and performance.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If a single compression technique is applied to the entire segment, then storage space is optimized for infrequently accessed records, but performance deteriorates for frequently accessed records
Solution Approach 1:
The patent divides a database segment into multiple sub-segments, where each sub-segment can apply a different compression technique. This segmentation allows frequently accessed records to be stored in sub-segments with lower compression (or no compression) for fast retrieval, while infrequently accessed records are stored in sub-segments with high compression to save space. The segment is thus segmented into multiple storage zones with different optimization characteristics.
Solution Approach 2:
The patent applies different compression techniques to different parts (sub-segments) of the database segment based on local access patterns. Each sub-segment has its own compression settings optimized for its specific access frequency characteristics, rather than applying a uniform compression technique to the entire segment. This local optimization resolves the contradiction between storage efficiency and performance.
2Ease of operation
If records are deleted from a segment, then space is freed for individual record access, but storage efficiency deteriorates due to fragmentation
Solution Approach 1:
The patent divides the segment into multiple sub-segments, which isolates fragmentation to specific sub-segments rather than affecting the entire segment. When records are deleted, only the affected sub-segment experiences fragmentation, while other sub-segments remain compact and efficient. This segmentation contains the harmful effects of fragmentation.
Solution Approach 2:
The patent enables more effective recovery of deleted record space by allowing sub-segments to be reorganized and compacted independently. Free space within sub-segments can be reclaimed and made available for new records or bulk loads more efficiently, reducing the impact of fragmentation on overall storage efficiency.
Data Source
AI summary
Techniques are provided for optimizing storage of database data records in segments using sub-segments. A segment may be comprised of a plurality of extents that contain data blocks and a plurality of references to sub-segments. Sub-segments are containers that contain other extents. A request to insert a set of records into a segment may be received by a database management system. Upon receiving the request, a particular sub-segment is selected to temporarily store the set of records. The set of records are inserted into data blocks belonging to an extent of the sub-segment. Access frequency for the set of records is monitored to determine whether the access frequency is less than a first threshold. When the access frequency of a subset of records is less than a first threshold, the subset of records is compressed and inserted into a particular extent of a particular segment.