IP Library Granted Patent US 11,841,829
Granted Patent B2
US 11,841,829 · App. 17/383,555 · Granted Dec 12, 2023

Content-based dynamic hybrid data compression

Inventors: Xiao Na Zhang (Shanghai, CN); Dong Liang Huang (Shanghai, CN)
Assignee: Dell Products L.P.
G06F16/1744G06N20/00H03M7/3064H03M7/3071H03M7/6064
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,841,829
App. No.
17/383,555
Granted
Dec 12, 2023
Kind
B2
Abstract

An information handling system includes a processor configured to process a training data file to determine an optimal data compression algorithm. The processor may also perform a compression ratio analysis that includes compressing the training data file using data compression algorithms, calculating a compression ratio associated with each of the data compression algorithms, determining an optimal compression ratio from the compression ratio associated with the each data compression algorithm; and determining a desirable data compression algorithm associated with the training data file based on the optimal compression ratio. The processor may also perform a probability analysis that includes generating a symbol transition matrix based on the desirable data compression algorithm, extracting statistical feature data based on the symbol transition matrix, and generating probability matrices based on the statistical feature data to determine the optimal data compression algorithm for each segment of a working data file.

Claims (51)

1. A method comprising:

processing a training data file to predict an optimal data compression algorithm, wherein the processing of the training data file includes:

performing a compression ratio analysis that includes:

compressing the training data file using a plurality of data compression algorithms;

calculating a compression ratio associated with each data compression algorithm of the data compression algorithms;

determining an optimal compression ratio from the compression ratios associated with the each of the data compression algorithms; and

identifying a desirable data compression algorithm associated with the optimal compression ratio for the training data file; and

performing a probability analysis that includes:

generating a symbol transition matrix based on the desirable data compression algorithm;

extracting statistical feature data based on the symbol transition matrix; and

generating probability matrices based on the statistical feature data for predicting the optimal data compression algorithm for each segment of a working data file.

2. The method of claim 1 , generating a compression ratio analysis table that includes an association of the training data file with the desirable data compression algorithm.

3. The method of claim 1 , wherein the optimal compression ratio has a maximum value in comparison with at least one other compression ratio associated with the training data file.

4. The method of claim 1 , further comprising processing the working data file, wherein the processing of the working data file includes dividing the working data file into a one or more segments and compressing each segment based on the optimal data compression algorithm generating one or more compressed segments.

5. The method of claim 4 , wherein each segment of the working data file is of equal length.

6. The method of claim 4 , further comprising combining each compressed segment using a unified format into a compressed data file.

7. The method of claim 6 , wherein a first data compression algorithm is used to compress a first segment and a second data compression algorithm is used to compress a second segment of the compressed data file.

8. The method of claim 1 , wherein the probability matrices include an initial state distribution matrix, a state transition probability matrix, and an observation probability matrix.

9. An information handling system, comprising:

a memory to store probability matrices used in determining an optimal data compression algorithm; and

a processor coupled to the memory, the processor configured to process a training data file to determine the optimal data compression algorithm, wherein the processor is further configured to:

perform a compression ratio analysis that includes:

compressing the training data file using a plurality of data compression algorithms;

calculating a compression ratio associated with each of the data compression algorithms;

determining an optimal compression ratio from the compression ratio associated with the each of the data compression algorithm; and

determining a desirable data compression algorithm associated with the training data file based on the optimal compression ratio; and

perform a probability analysis that includes:

generating a symbol transition matrix based on the desirable data compression algorithm;

extracting statistical feature data based on the symbol transition matrix; and

generating probability matrices based on the statistical feature data to determine the optimal data compression algorithm for each segment of a working data file.

10. The information handling system of claim 9 , wherein the processor is further configured to generate a compression ratio analysis table that includes an association of the training data file with the desirable data compression algorithm.

11. The information handling system of claim 9 , wherein the optimal compression ratio has a maximum value in comparison with at least one other compression ratio associated with the training data file.

12. The information handling system of claim 9 , wherein the processor is further configured to process the working data file that includes to divide the working data file into a one or more segments and to compress each segment based on the optimal data compression algorithm generating one or more compressed segments.

13. The information handling system of claim 12 , wherein the processor is further configured to combine each compressed segment using a unified format into a compressed data file.

14. The information handling system of claim 12 , wherein each segment of the working data file is of equal length.

15. A non-transitory computer-readable medium including code that when executed performs a method, the method comprising:

processing a training data file to determine an optimal data compression algorithm, wherein the processing of the training data file includes:

performing compression ratio analysis that includes:

compressing the training data file using a plurality of data compression algorithms;

calculating a compression ratio associated with each data compression algorithm of the data compression algorithms;

determining an optimal compression ratio from the compression ratio associated with the each data compression algorithm; and

determining a desirable data compression algorithm associated with the training data file based on the compression ratio; and

performing a probability analysis that includes:

generating a symbol transition matrix based on the desirable data compression algorithm;

extracting statistical feature data based on the symbol transition matrix; and

generating probability matrices based on the statistical feature data for determining the optimal data compression algorithm for each segment of a working data file.

16. The method of claim 15 , further comprising processing the working data file, wherein the processing of the working data file includes dividing the working data file into one or more segments and compressing each segment based on the optimal data compression algorithm generating one or more compressed segments.

17. The method of claim 16 , wherein each segment of the working data file is of equal length.

18. The method of claim 16 , further comprising combining each compressed segment using a unified format into a compressed data file.

19. The method of claim 18 , wherein a first data compression algorithm is used to compress a first segment and a second data compression algorithm is used to compress a second compressed segment of the compressed data file.

20. The method of claim 15 , wherein the probability matrices include an initial state distribution matrix, a state transition probability matrix, and an observation probability matrix.

Assignments (8)
RELEASE OF SECURITY INTEREST IN PATENTS PREVIOUSLY RECORDED AT REEL/FRAME (058014/0560) Recorded Jun 10, 2022
From: THE BANK OF NEW YORK MELLON TRUST COMPANY, N.A., AS NOTES COLLATERAL AGENT
To: DELL PRODUCTS L.P.; EMC IP HOLDING COMPANY LLC
Reel/Frame 062022/0473 →
RELEASE OF SECURITY INTEREST IN PATENTS PREVIOUSLY RECORDED AT REEL/FRAME (057931/0392) Recorded Jun 10, 2022
From: THE BANK OF NEW YORK MELLON TRUST COMPANY, N.A., AS NOTES COLLATERAL AGENT
To: DELL PRODUCTS L.P.; EMC IP HOLDING COMPANY LLC
Reel/Frame 062022/0382 →
RELEASE OF SECURITY INTEREST IN PATENTS PREVIOUSLY RECORDED AT REEL/FRAME (057758/0286) Recorded Jun 10, 2022
From: THE BANK OF NEW YORK MELLON TRUST COMPANY, N.A., AS NOTES COLLATERAL AGENT
To: DELL PRODUCTS L.P.; EMC IP HOLDING COMPANY LLC
Reel/Frame 061654/0064 →
SECURITY INTEREST Recorded Oct 6, 2021
From: DELL PRODUCTS L.P.; EMC IP HOLDING COMPANY LLC
To: THE BANK OF NEW YORK MELLON TRUST COMPANY, N.A., AS NOTES COLLATERAL AGENT
Reel/Frame 058014/0560 →
SECURITY INTEREST Recorded Oct 6, 2021
From: DELL PRODUCTS L.P.; EMC IP HOLDING COMPANY LLC
To: THE BANK OF NEW YORK MELLON TRUST COMPANY, N.A., AS NOTES COLLATERAL AGENT
Reel/Frame 057758/0286 →
SECURITY INTEREST Recorded Oct 6, 2021
From: DELL PRODUCTS L.P.; EMC IP HOLDING COMPANY LLC
To: THE BANK OF NEW YORK MELLON TRUST COMPANY, N.A., AS NOTES COLLATERAL AGENT
Reel/Frame 057931/0392 →
SECURITY AGREEMENT Recorded Oct 1, 2021
From: DELL PRODUCTS, L.P.; EMC IP HOLDING COMPANY LLC
To: CREDIT SUISSE AG, CAYMAN ISLANDS BRANCH
Reel/Frame 057682/0830 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 23, 2021
From: ZHANG, XIAO NA; HUANG, DONG LIANG
To: DELL PRODUCTS, LP
Reel/Frame 056955/0903 →
Priority Claims (1)
CN 202110571311.3 · May 25, 2021 · national
Continuity (1)
Related Publication 20220382717A1 · Dec 1, 2022