IP Library Granted Patent US 12,373,393
Granted Patent B2
US 12,373,393 · App. 18/475,849 · Granted Jul 29, 2025

Data compression method and apparatus

Inventors: Bang Liu (Saint Petersburg, RU); Kai Zhu (Chengdu, CN); Ke Li (Chengdu, CN); Wen Yang (Chengdu, CN); Jianqiang Shen (Hangzhou, CN)
Assignee: HUAWEI TECHNOLOGIES CO., LTD.
G06F16/1744G06F3/0608G06F3/0641G06F3/0673
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 12,373,393
App. No.
18/475,849
Granted
Jul 29, 2025
Kind
B2
Abstract

A data compression method includes providing one or more data block sets, where each data block set includes a plurality of data blocks with a same fingerprint; providing one or more compression groups based on a similarity degree between a plurality of data blocks included in each data block set, where one compression group includes a plurality of similar data blocks, the plurality of similar data blocks are a subset of data blocks included in the one or more data block sets, and a similarity degree between the plurality of similar data blocks meets a specific similarity condition; and compressing the plurality of similar data blocks included in the compression group.

Claims (39)

1. A method comprising:

providing one or more data block sets;

generating one or more compression groups based on a similarity degree between a plurality of data blocks in each of the data block sets, wherein a compression group of the one or more compression groups comprises a plurality of similar data blocks in the one or more data block sets, wherein each of the similar data blocks has N data features that describe a data block from N dimensions, and wherein the similarity degree meets a similarity condition; and

compressing the plurality of similar data blocks comprised in the compression group;

wherein the similarity condition comprises that at least two of the similar data blocks share M data features of the N data features, wherein M is less than or equal to N, and wherein there is an association relationship between the plurality of similar data blocks in the compression group,

wherein the plurality of similar data blocks form a logic chain, wherein the association relationship is that two adjacent similar data blocks on the logic chain share P data features, and wherein P is greater than or equal to M and less than or equal to N, and

wherein compressing the plurality of similar data blocks comprised in the compression group comprises:

selecting for a data block on a child node in a tree relationship a data block on a parent node of the child node as a reference data block; and

performing delta compression on the child node data blocks based on the respective reference blocks to obtain compressed data.

2. The method of claim 1 , wherein the similarity condition further comprises that M is greater than a threshold.

3. The method of claim 1 , wherein a quantity of the plurality of similar data blocks is X, wherein the similarity condition comprises selecting X data blocks with a highest similarity degree from the one or more data block sets based on the N data features, and wherein X is an integer greater than or equal to 2.

4. The method of claim 1 , further comprising:

calculating a similar fingerprint of a to-be-compressed data block;

recording the to-be-compressed data block into a first data block set corresponding to a second data block that has the same fingerprint as the to-be-compressed data block, wherein the first data block set is one of the one or more data block sets;

determining, from the first data block set, a target data block that shares data features with the to-be-compressed data block;

determining a first compression group comprising the target data block; and

adding the to-be-compressed data block to the first compression group.

5. The method of claim 1 , further comprising generating metadata of the compressed data, wherein the metadata comprises location information of the plurality of similar data blocks, and wherein the metadata is for decompressing the compressed data.

6. The method of claim 1 , further comprising generating metadata of the compressed data, wherein the metadata comprises information about the reference data block during the delta compression and comprises location information of data from the delta compression on each similar data block, and wherein the metadata is for decompressing the compressed data.

7. An apparatus comprising:

a memory configured to store instructions; and

a processor coupled to the memory and configured to: provide one or more data block sets;

generate one or more compression groups based on a similarity degree between a plurality of data blocks in each of the data block sets, wherein a compression group of the one or more compression groups comprises a plurality of similar data blocks in the one or more data block sets, wherein each of the similar data blocks has N data features that describe a data block from N dimensions, and wherein the similarity degree meets a similarity condition; and

compress the plurality of similar data blocks comprised in the compression group,

wherein the similarity condition comprises that at least two of the similar data blocks share M data features of the N data features, wherein M is less than or equal to N, and wherein there is an association relationship between the plurality of similar data blocks in the compression group,

wherein the plurality of similar data blocks form a logic chain, wherein the association relationship is that two adjacent similar data blocks on the logic chain share P data features, and wherein P is greater than or equal to M and less than or equal to N, and

wherein compressing the plurality of similar data blocks comprised in the compression group comprises:

selecting for a data block on a child node in a tree relationship a data block on a parent node of the child node as a reference data block; and

performing delta compression on the child node data blocks based on the respective reference blocks to obtain compressed data.

8. The apparatus of claim 7 , wherein the similarity condition further comprises that M is greater than a threshold.

9. The apparatus of claim 7 , wherein a quantity of the plurality of similar data blocks is X, wherein the similarity condition comprises selecting X data blocks with a highest similarity degree from the one or more data block sets based on the N data features, and wherein X is an integer greater than or equal to 2.

10. The apparatus of claim 7 , wherein the processor is further configured to:

calculate a similar fingerprint of a to-be-compressed data block;

record the to-be-compressed data block into a first data block set corresponding to a second data block that has the same similar fingerprint as the to-be-compressed data block, wherein the first data block set is one of the one or more data block sets;

determine, from the first data block set, a target data block that shares data features with the to-be-compressed data block;

determine a first compression group comprising the target data block; and

add the to-be-compressed data block to the first compression group.

11. The apparatus of claim 7 , wherein the processor is further configured to generate metadata of the compressed data, wherein the metadata comprises location information of the plurality of similar data blocks, and wherein the metadata is for decompressing the compressed data.

12. The apparatus of claim 7 , wherein the processor is further configured to generate metadata of the compressed data, wherein the metadata comprises information about the reference data block during the delta compression and location information of data from the delta compression on each similar data block, and wherein the metadata is for decompressing the compressed data.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 17, 2025
From: LIU, BANG; ZHU, KAI; LI, KE; YANG, WEN; SHEN, JIANQIANG
To: HUAWEI TECHNOLOGIES CO., LTD.
Reel/Frame 071744/0404 →
Priority Claims (1)
CN 202110343632.8 · Mar 30, 2021 · national
Continuity (2)
Continuation PCTCN2022080171 · Mar 10, 2022
Related Publication 20240020005A1 · Jan 18, 2024
References Cited (16)
US 9678977B1 · Aronovich · 2017 [cited by examiner]
US 10572153B2 · Singhai · 2020 [cited by examiner]
US 11797204B2 · Luo · 2023 [cited by examiner]
US 20100125553A1 · Huang · 2010 [cited by examiner]
US 20170123676A1 · Singhai · 2017 [cited by examiner]
US 20190294589A1 · Moiseev · 2019 [cited by examiner]
US 20200387479A1 · Karr · 2020 [cited by examiner]
US 20210397350A1 · Luo et al. · 2021 [cited by applicant]
US 20220147255A1 · Guan et al. · 2022 [cited by applicant]
US 20220236870A1 · Shabi · 2022 [cited by examiner]
US 20220365875A1 · Mao · 2022 [cited by examiner]
US 20230019207A1 · Natanzon · 2023 [cited by examiner]
EP 2571171A2 · 2013 [cited by applicant]
WO 2018111133A1 · 2018 [cited by applicant]
WO 2020253406A1 · 2020 [cited by applicant]
WO 2021012162A1 · 2021 [cited by applicant]