Storage Object Compression Thresholds for Faster Data Retrieval
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for managing data storage and retrieval in random access devices are inefficient due to the need for complex compression modules that perform virtual address translation and garbage collection, which can increase storage capacity but not necessarily reduce data transfer times, especially in systems where write data rates are significantly slower than read data rates.
Innovation Solution
A method that applies successive compression data transformations to data objects, selects the transformation resulting in the shortest compressed data object, and only writes the compressed data with associated compression information if it meets a threshold reduction in size, otherwise writing the original data, to optimize storage and retrieval processes without requiring complex compression modules.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If complex compression modules with virtual address translation are used for random access devices, then storage capacity is increased, but device complexity and data transfer time are worsened
Solution Approach 1:
The patent extracts the compression functionality from complex virtualization layers and implements it directly in the disk controller hardware. This separates the compression function from the application layer and integrates it into the storage controller, reducing overall system complexity while maintaining compression capabilities.
Solution Approach 2:
The patent introduces a simple compression indicator bit in the data structure that acts as an intermediary marker. This bit signals whether compression was applied to a data object, allowing the system to track compressed data without requiring complex metadata structures or virtualization layers.
2Quantity of substance
If complex compression modules with virtual address translation are used, then storage capacity is increased, but data transfer speed is worsened
Solution Approach 1:
The patent performs compression at the time of data writing to the disk, before the data is stored. This preliminary compression action ensures that compressed data occupies less space on the disk, thereby increasing effective storage capacity without impacting read speeds, as compressed data can be directly read without requiring decompression during retrieval.
3Quantity of substance
If compression is applied to all data objects, then storage capacity is increased, but write time is worsened due to processing overhead
Solution Approach 1:
The patent applies compression selectively rather than universally. By using the compression indicator bit, the system can identify which data objects have been compressed and which have not, allowing for partial compression action only when beneficial, thus reducing overall processing overhead while still achieving storage capacity improvements for suitable data.
4Reliability
If compression information is stored with each data object, then data integrity is improved, but device complexity is worsened
Solution Approach 1:
The patent implements local quality by using a single compression indicator bit within each data object structure. This localized approach provides compression tracking information exactly where needed (in the data object itself) without adding global complexity to the file system or storage management structures.
Data Source
AI summary
A technique for managing storage of a data object in a storage device involves receiving the data object (A) to store in the storage device, where the data object has an indicator bit pattern (P). Successive compression data transformations are applied to data object A to obtain respective corresponding compressed data objects, and one of these compressed data objects is selected, such that the selected compressed data object (C) has the shortest length with respect to the remaining compressed data objects. Compression information (I) is then associated with the compression data transformation used to generate data object C, and a threshold value T is calculated at least partly from the length of compression information I. If length (C)+T.gtoreq.length (A), then the indicator bit pattern of data object A is reset and the data object A is written to the storage device. If length (C)+T<length (A), then the indicator bit pattern of data object C is set, compression information I is incorporated into data object C, and data object C is written to the storage device.