Server Data Compression by File-Type Sub-Block Parsing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing server compression methods achieve a relatively low compression ratio for data blocks due to the use of a single compression algorithm for data with specific characteristics, limiting storage efficiency.
Innovation Solution
A server method that parses data blocks to determine file types and characteristics, selects the most efficient compression algorithm from multiple candidates based on these characteristics, and applies it to sub-blocks within the data block, improving compression efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If a single compression algorithm is used to compress data in a data block, then the device complexity is reduced, but the compression ratio is relatively low
Solution Approach 1:
The patent divides the data block into multiple data sub-blocks based on file types and characteristics. Each data sub-block is then compressed using a compression algorithm specifically selected for its characteristics, rather than applying a single algorithm to the entire data block. This segmentation allows optimal compression for each subset while maintaining manageable system complexity.
Solution Approach 2:
The patent applies different compression algorithms to different data sub-blocks according to their specific characteristics (e.g., text files use one algorithm, binary files use another). This local optimization ensures that each portion of data is compressed by the most suitable algorithm for its type, thereby improving the overall compression ratio without requiring a single complex algorithm to handle all cases.
2Quantity of substance
If multiple compression algorithms are selected and applied to different data sub-blocks, then the compression ratio is improved, but the device complexity increases
Solution Approach 1:
The patent performs preliminary parsing of the data block to identify file types and characteristics before compression. By pre-categorizing data into different data sub-blocks based on their characteristics, the system prepares the data structure in advance, making the subsequent selection and application of appropriate compression algorithms more straightforward and less complex.
Solution Approach 2:
The patent changes the parameter of algorithm selection from a static single-algorithm approach to a dynamic multi-algorithm approach based on data characteristics. The system selects compression algorithms as a variable parameter that adapts to the specific characteristics of each data sub-block, allowing optimal compression while managing complexity through characteristic-based classification.
Data Source
Figure 1~2
Figure 3
Figure 4A
AI summary
A server and a method for compressing data by a server are provided, which relate to the storage field and are used to resolve a prior-art problem that a compression ratio at which data in a data block is compressed by a server is relatively low. The method includes: parsing, by a server, an information block in a data block, to obtain a file type of data in the data block and a data sub-block that is included in the data block; determining a characteristic of data in the data sub-block according to the file type; selecting, according to the characteristic, a target compression algorithm that is used to compress the data in the data sub-block; and compressing the data in the data sub-block by using the target compression algorithm. Embodiments of the present invention are used to compress data.