Selective Data Compression for Random-Access Storage Overhead
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Random access storage devices face challenges in transparent data compression due to the need for complex compression modules with virtual address translation and garbage collection, which complicates the process and increases overhead, whereas sequential access devices can compress data more efficiently without these requirements.
Innovation Solution
A method involving an ASIC that selectively applies compression algorithms to data objects, choosing the algorithm that results in the shortest compressed data object and only storing compression information if the reduction meets a threshold, allowing for transparent compression management without complex virtualization layers.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If compression is applied to random access storage devices, then data transfer speed and performance are improved, but device complexity increases due to required virtualization layers
Solution Approach 1:
The patent extracts the virtualization layer from the compression module, separating the compression function from the address translation and garbage collection functions. This allows the compression algorithm to operate directly on the data without requiring complex virtualization infrastructure, thereby reducing device complexity while maintaining compression benefits for random access storage devices
Solution Approach 2:
The patent creates a universal compression approach that works for both sequential and random access storage devices without requiring device-specific virtualization layers. The same compression module can be applied across different storage types, simplifying the overall system architecture while maintaining performance improvements
2Quantity of substance
If compression algorithms are applied to reduce data size, then storage capacity is improved, but write time increases due to processing overhead
Solution Approach 1:
The patent applies partial compression by selectively compressing only those data objects that meet specific criteria (e.g., sufficient size, appropriate data patterns). Not all data is compressed, which reduces the overall processing overhead and write time while still achieving meaningful storage capacity improvements for eligible data objects
Solution Approach 2:
The patent changes the compression parameters and thresholds dynamically based on data characteristics and storage conditions. By adjusting compression aggressiveness and selection criteria, the system optimizes the balance between storage capacity gains and write time penalties, applying compression only when beneficial
3Quantity of substance
If complex compression modules with virtualization are used, then storage efficiency is improved, but ease of operation deteriorates
Solution Approach 1:
The patent removes the virtualization layer and garbage collection mechanisms from the compression module, simplifying the operation to basic compression and decompression functions. This makes the system easier to operate and understand while maintaining storage efficiency through direct compression of data objects without complex management overhead
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≧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.