公开(公告)号：US20240283463A1

公开(公告)日：2024-08-22

申请号：US18567644

申请日：2022-04-07

Applicant: HUAWEI TECHNOLOGIES CO., LTD.

Inventor： Chao YU ,  Yi CHEN ,  Guifu LI ,  Ge QIU ,  Zhipeng LI ,  Daiyue ZHANG ,  Jing QIAN

IPC: H03M7/30 ,  G06F3/06

CPC classification number: H03M7/6047 ,  G06F3/0608 ,  G06F3/064

Abstract: This application discloses a data compression method and apparatus. The method includes: obtaining m data blocks in a data area of a readable and writable file system; compressing the m data blocks by using a preset compression algorithm, to sequentially obtain n compressed data blocks, where first capacities of the compressed data blocks are the same, and the first capacity represents a quantity of bytes of compressed data that can be included in the compressed data block; and establishing a first index of each of j data blocks corresponding to an ith compressed data block in the n compressed data blocks, and recording a mapping relationship between first indexes and the j data blocks. The first index is used to identify a storage location, in a storage medium, of each data block included in the j data blocks, and attribute information included in each of the j data blocks.

公开(公告)号：US20190196738A1

公开(公告)日：2019-06-27

申请号：US16291852

申请日：2019-03-04

Applicant: Huawei Technologies Co., Ltd. ,  UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA

Inventor： Yinlong XU ,  Zhipeng LI ,  Yuangang WANG

IPC: G06F3/06 ,  G06F16/13 ,  G06F17/11

CPC classification number: G06F3/0647 ,  G06F3/0607 ,  G06F3/0611 ,  G06F3/0619 ,  G06F3/064 ,  G06F3/0646 ,  G06F3/0689 ,  G06F11/1076 ,  G06F16/13 ,  G06F17/11

Abstract: A data migration method for a storage system after expansion and a storage system are provided. After an ith expansion is performed on the storage system, data migration is performed by using an auxiliary balanced incomplete block design. Because a quantity of tuples including any element in the auxiliary balanced incomplete block design is identical, and each migration unit includes an identical quantity of parity chunks, a data migration amount after the expansion is minimized. In this way, time required for data migration after the expansion is significantly reduced, and a delay in a response to a user request that is caused because a data migration operation needs to be performed after the expansion is also reduced.