Dynamic Differential Compression for Storage Lookup Tables
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Data storage devices face significant space occupancy issues due to the substantial size of mapping data required for logical to physical address mappings, with existing differential compression methods being inefficient as they use a fixed number of bytes to express differentials, limiting their effectiveness.
Innovation Solution
A dynamic differential compression scheme is implemented, where the number of bytes used to express differentials can change, using a packet header to indicate packet type and the number of physical addresses, allowing for efficient compression by varying the representation based on differential values, balancing coverage and efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If fixed-byte differential compression is used, then implementation simplicity is improved, but compression effectiveness deteriorates
Solution Approach 1:
The patent implements dynamic differential compression where the number of bytes used to represent differentials varies based on the actual differential values. The system dynamically selects between 1-byte and 2-byte representations depending on whether the differential fits within the smaller format, allowing the compression scheme to adapt to the actual data characteristics rather than using a fixed approach.
Solution Approach 2:
The patent changes the parameter of differential representation from a fixed byte count to a variable byte count based on the magnitude of the differential. By monitoring the differential value and adjusting the representation format accordingly, the system optimizes compression ratios while maintaining implementation feasibility through structured packet formatting.
2Loss of substance
If larger chunk sizes are used, then compression ratio is improved, but memory usage and processing complexity increase
Solution Approach 1:
The patent segments the lookup table into manageable chunks that are processed independently. Each chunk is handled as a separate unit with its own packet structure, allowing the system to benefit from larger effective compression ratios while limiting memory usage and processing complexity to manageable levels through modular chunk-based processing.
Data Source
AI summary
A method for storing data on a storage device includes receiving data to be stored and a logical address for storing the data. A physical address is determined and the data to be stored is stored at the determined physical address. A table that associates logical addresses with physical addresses is examined to determine a difference relationship between the determined physical address and a corresponding physical address for one of other logical addresses. Information representing the determined physical address is stored in the table, in association with the received logical address, as a function of the determined difference relationship. A data storage device includes controller circuitry and memory for storing a lookup table that associates logical addresses with physical addresses. The controller circuitry operates in accordance with the method.