Patents by Inventor Shaohui QUAN

Shaohui QUAN has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 11411577
    Abstract: A data compression method includes obtaining N to-be-compressed data blocks and N pieces of protection information (PI), where the N to-be-compressed data blocks are in a one-to-one correspondence with the N pieces of PI, and N is a positive integer greater than or equal to 2, compressing the N to-be-compressed data blocks to obtain a compressed data block, and compressing the N pieces of PI to obtain compressed PI.
    Type: Grant
    Filed: April 29, 2021
    Date of Patent: August 9, 2022
    Assignee: HUAWEI TECHNOLOGIES CO., LTD.
    Inventors: Kun Guan, Aleksei Valentinovich Romanovskii, Shaohui Quan, Gongyi Wang
  • Publication number: 20220147255
    Abstract: In a method of storing data block, a storage device has stored a plurality of data block groups, each data block group having a common part that is contained in another data block in that group. For a target block to be stored, the storage device selects from the data block groups a target data block group has one data block whose common part is identical to a part of the target data block. The storage device then saves the target block by storing a target reference block of the target data block group and differential data between the target data block and the target reference block.
    Type: Application
    Filed: January 20, 2022
    Publication date: May 12, 2022
    Applicant: HUAWEI TECHNOLOGIES CO., LTD.
    Inventors: Kun Guan, Shaohui Quan, Liyu Wang, Jianqiang Shen
  • Patent number: 11177825
    Abstract: A device and a method for an improved compacting of compressed and uncompressed data blocks into an output buffer are provided. The device is configured to obtain a set of input data blocks comprising at least one of a compressed data block and an uncompressed data block; compact the compressed data blocks into the output buffer, starting from a first predefined region in the output buffer, such that the compressed data blocks are sequentially compacted; and compact the uncompressed data blocks into the output buffer, starting from a second predefined region in the output buffer, such that the uncompressed data blocks are sequentially compacted.
    Type: Grant
    Filed: August 4, 2020
    Date of Patent: November 16, 2021
    Assignee: Huawei Technologies Co., Ltd.
    Inventors: Aleksei Valentinovich Romanovskii, Ilya Aleksandrovich Papiev, Jinbao Niu, Qiang Xue, Shaohui Quan
  • Publication number: 20210318836
    Abstract: This application provides a data compression method and apparatus, and relates to the field of storage technologies. The method includes: after receiving to-be-stored first data, a storage device may determine whether the first data is hot write data, and compress the first data using a selected compression algorithm if the first data is not hot write data.
    Type: Application
    Filed: June 25, 2021
    Publication date: October 14, 2021
    Inventors: Jinbao NIU, Shaohui QUAN, Xiaodong TAN
  • Publication number: 20210250042
    Abstract: A data compression method includes obtaining N to-be-compressed data blocks and N pieces of protection information (PI), where the N to-be-compressed data blocks are in a one-to-one correspondence with the N pieces of PI, and N is a positive integer greater than or equal to 2, compressing the N to-be-compressed data blocks to obtain a compressed data block, and compressing the N pieces of PI to obtain compressed PI.
    Type: Application
    Filed: April 29, 2021
    Publication date: August 12, 2021
    Inventors: Kun Guan, Aleksei Valentinovich Romanovskii, Shaohui Quan, Gongyi Wang
  • Publication number: 20200366314
    Abstract: A device and a method for an improved compacting of compressed and uncompressed data blocks into an output buffer are provided. The device is configured to obtain a set of input data blocks comprising at least one of a compressed data block and an uncompressed data block; compact the compressed data blocks into the output buffer, starting from a first predefined region in the output buffer, such that the compressed data blocks are sequentially compacted; and compact the uncompressed data blocks into the output buffer, starting from a second predefined region in the output buffer, such that the uncompressed data blocks are sequentially compacted.
    Type: Application
    Filed: August 4, 2020
    Publication date: November 19, 2020
    Inventors: Aleksei Valentinovich ROMANOVSKII, Ilya Aleksandrovich PAPIEV, Jinbao NIU, Qiang XUE, Shaohui QUAN
  • Patent number: 10305512
    Abstract: An encoding method and apparatus is described. In an encoding method, when a first target sub-block in a target block is obtained, a hash operation is first performed on the first target sub-block. Then, a first hash table is queried for a corresponding hash value according to an operation result, and a corresponding location in a reference block is found according to the hash value obtained by means of query, that is, first reference data is found. The first piece of target data in the first target sub-block is matched with the first reference data, and second target data in the target block is matched with second reference data in the reference block. In this way, an approximate location is predetermined, so that a range in which matching needs to be performed is narrowed, a data compression time is reduced, and data compression efficiency is improved.
    Type: Grant
    Filed: March 16, 2018
    Date of Patent: May 28, 2019
    Assignee: HUAWEI TECHNOLOGIES, CO., LTD.
    Inventors: Kun Guan, Jinan Leng, Gongyi Wang, Shaohui Quan, Jianqiang Shen
  • Publication number: 20180205393
    Abstract: An encoding method and apparatus is described. In an encoding method, when a first target sub-block in a target block is obtained, a hash operation is first performed on the first target sub-block. Then, a first hash table is queried for a corresponding hash value according to an operation result, and a corresponding location in a reference block is found according to the hash value obtained by means of query, that is, first reference data is found. The first piece of target data in the first target sub-block is matched with the first reference data, and second target data in the target block is matched with second reference data in the reference block. In this way, an approximate location is predetermined, so that a range in which matching needs to be performed is narrowed, a data compression time is reduced, and data compression efficiency is improved.
    Type: Application
    Filed: March 16, 2018
    Publication date: July 19, 2018
    Inventors: Kun GUAN, Jinan LENG, Gongyi WANG, Shaohui QUAN, Jianqiang SHEN