Integer Set Compression Using Recursive Range Subdivision
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data compression techniques for sets of integers in computer-readable media are inefficient, as they do not effectively reduce storage space usage and do not account for the order or distribution of integers, leading to suboptimal memory storage efficiency.
Innovation Solution
The method involves determining a range of integers and recursively subdividing it into sub-ranges, storing indications of the smallest and largest integers, and middle integers within these sub-ranges, using fewer bits to represent each integer, thereby reducing the overall storage requirements.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If conventional compression techniques are used for sets of integers, then some reduction in storage space is achieved, but the compression efficiency is insufficient and does not account for integer distribution patterns
Solution Approach 1:
The patent changes the representation parameters of integers by encoding them relative to a dynamically determined baseline value rather than using fixed-bit representations. This allows the storage format to adapt to the actual distribution characteristics of the integer set, achieving better compression ratios while maintaining efficient encoding and decoding operations.
Solution Approach 2:
The patent introduces dynamic adaptation by calculating the baseline value from the actual integer data (e.g., using the minimum value or a statistical measure) and adjusting the encoding scheme accordingly. This dynamic approach allows the compression method to optimize for each specific dataset rather than using a static compression scheme, thereby improving compression efficiency.
2Measurement precision
If more bits are used to represent each integer, then storage precision is maintained, but storage space consumption increases
Solution Approach 1:
The patent transforms the storage parameters from fixed-bit representations to variable-length encodings based on the difference between each integer and a baseline value. This parameter change allows precise representation of integers while using fewer bits on average, as the differences are typically smaller than the absolute values and can be encoded more efficiently.
Solution Approach 2:
The patent merges the storage of the baseline value with the storage of individual integer differences. By storing one baseline value for the entire set and then storing only the differences from this baseline, the system achieves space-efficient storage while maintaining full precision for reconstructing all original integer values.
3Productivity
If the integer set is sorted to improve compression, then compression efficiency increases, but processing time increases
Solution Approach 1:
The patent performs preliminary sorting of the integer set before compression encoding. By sorting the data first, the patent enables more effective exploitation of data patterns and distribution characteristics, which improves the efficiency of the subsequent compression process. The preliminary organization of data allows for better baseline selection and more predictable encoding patterns.
Data Source
AI summary
These present disclosure provides devices and techniques to compress a list of integers. A circuit may include a sorter to sort a list of integers and a subtractor to determine a range of integers represented in the list and to recursively subdivide the range into sub-ranges. The circuit may also include a bit determiner to determine an amount of information (e.g., bits) to use to add indications of the integers in the list to a compresses list information element based on the range and the sub-ranges.