Compressed data layout for optimizing data transactions

    公开(公告)号:US10311026B2

    公开(公告)日:2019-06-04

    申请号:US15167277

    申请日:2016-05-27

    Abstract: The embodiments described herein relate to managing compressed data to optimize file compression for efficient random access to the data. A first partition of a first data block of a compression group is compressed. The first compressed partition is stored in a first compression entity. An in-memory table is maintained, which includes updating the in-memory table with data associated with an address of the stored compressed first partition. At such time as it is determined that the first compression entity is full, the in-memory table is compressed and written to the first compression entity. Accordingly, the in-memory table, which stores partition compression data, is store with the compression entity.

    POLICY-BASED, MULTI-SCHEME DATA REDUCTION FOR COMPUTER MEMORY
    2.
    发明申请
    POLICY-BASED, MULTI-SCHEME DATA REDUCTION FOR COMPUTER MEMORY 审中-公开
    用于计算机存储器的基于策略的多方案数据减少

    公开(公告)号:US20160246799A1

    公开(公告)日:2016-08-25

    申请号:US14627385

    申请日:2015-02-20

    CPC classification number: G06F17/30156

    Abstract: Embodiments relate to policy-based, multi-scheme data reduction for a computer memory. An aspect includes receiving a plurality of policy rules by a policy engine of the computer memory, wherein a first policy rule specifies applying a first data reduction scheme to data in the computer memory based on the data matching first characteristics, wherein a second policy rule specifies applying a second data reduction scheme to data in the computer memory based on the data matching second characteristics, wherein the first data reduction scheme is different from the second data reduction scheme. Another aspect includes determining, by the policy engine, that first data in the computer memory matches the first characteristics, and that second data in the computer memory matches the second characteristics. Yet another aspect includes applying the first data reduction scheme to the first data, and applying the second data reduction scheme to the second data.

    Abstract translation: 实施例涉及用于计算机存储器的基于策略的多方案数据简化。 一方面包括由计算机存储器的策略引擎接收多个策略规则,其中第一策略规则指定基于匹配第一特征的数据将第一数据缩减方案应用于计算机存储器中的数据,其中第二策略规则指定 基于所述数据匹配第二特性对所述计算机存储器中的数据应用第二数据简化方案,其中所述第一数据简化方案与所述第二数据简化方案不同。 另一方面包括由策略引擎确定计算机存储器中的第一数据与第一特性匹配,并且计算机存储器中的第二数据与第二特性匹配。 另一方面包括将第一数据简化方案应用于第一数据,以及将第二数据简化方案应用于第二数据。

    POLICY-BASED, MULTI-SCHEME DATA REDUCTION FOR COMPUTER MEMORY

    公开(公告)号:US20180336219A1

    公开(公告)日:2018-11-22

    申请号:US16047322

    申请日:2018-07-27

    CPC classification number: G06F17/30156

    Abstract: Embodiments relate to policy-based, multi-scheme data reduction for a computer memory. An aspect includes receiving a plurality of policy rules by a policy engine of the computer memory, wherein a first policy rule specifies applying a first data reduction scheme to data in the computer memory based on the data matching first characteristics, wherein a second policy rule specifies applying a second data reduction scheme to data in the computer memory based on the data matching second characteristics, wherein the first data reduction scheme is different from the second data reduction scheme. Another aspect includes determining, by the policy engine, that first data in the computer memory matches the first characteristics, and that second data in the computer memory matches the second characteristics. Yet another aspect includes applying the first data reduction scheme to the first data, and applying the second data reduction scheme to the second data.

    COMPRESSED DATA LAYOUT FOR OPTIMIZING DATA TRANSACTIONS

    公开(公告)号:US20170344578A1

    公开(公告)日:2017-11-30

    申请号:US15167277

    申请日:2016-05-27

    CPC classification number: G06F17/30153 G06F17/30138

    Abstract: The embodiments described herein relate to managing compressed data to optimize file compression for efficient random access to the data. A first partition of a first data block of a compression group is compressed. The first compressed partition is stored in a first compression entity. An in-memory table is maintained, which includes updating the in-memory table with data associated with an address of the stored compressed first partition. At such time as it is determined that the first compression entity is full, the in-memory table is compressed and written to the first compression entity. Accordingly, the in-memory table, which stores partition compression data, is store with the compression entity.

    COMPRESSED DATA REARRANGEMENT TO OPTIMIZE FILE COMPRESSION

    公开(公告)号:US20170177603A1

    公开(公告)日:2017-06-22

    申请号:US14970592

    申请日:2015-12-16

    CPC classification number: G06F16/1744

    Abstract: The embodiments described herein relate to managing compressed data to optimize file compression. A first compression is performed on a first set of data to create first compressed data. The first compressed data is stored in one or more blocks of a first compression group. A size of free space of a last block of the first compression group is discovered and calculated. A second compression is performed on a second set of data to create second compressed data. At least a portion of the second compressed data is supplied to the first compression group for padding into the last block in response to determining that the size of the free space is sufficient. An unpadded portion of the second compressed data is stored in one or more blocks of a second compression group.

    Compressed data layout with variable group size

    公开(公告)号:US10804930B2

    公开(公告)日:2020-10-13

    申请号:US14970636

    申请日:2015-12-16

    Abstract: The embodiments described herein relate to managing compressed data to optimize file compression. A compression is performed on a first set of data to create a first set of compressed data partitions in a compression group. A partition table is constructed, and partition entries for the first data block are added to the table in conjunction with the first set. A current size of the compression group is assessed. In response to a compression ratio being greater than a target compression ratio and internal fragmentation of the compression group being smaller than a threshold, the compression group is dynamically completed. The dynamic completion decides a size for the compression group. The partition table is added to the compression group by assigning space within the first compression group for the table. The compression group is written to persistent storage.

    COMPRESSED DATA LAYOUT WITH VARIABLE GROUP SIZE

    公开(公告)号:US20170177602A1

    公开(公告)日:2017-06-22

    申请号:US14970636

    申请日:2015-12-16

    CPC classification number: H03M7/3077

    Abstract: The embodiments described herein relate to managing compressed data to optimize file compression. A compression is performed on a first set of data to create a first set of compressed data partitions in a compression group. A partition table is constructed, and partition entries for the first data block are added to the table in conjunction with the first set. A current size of the compression group is assessed. In response to a compression ratio being greater than a target compression ratio and internal fragmentation of the compression group being smaller than a threshold, the compression group is dynamically completed. The dynamic completion decides a size for the compression group. The partition table is added to the compression group by assigning space within the first compression group for the table. The compression group is written to persistent storage.

    Minimizing Metadata Representation In A Compressed Storage System
    10.
    发明申请
    Minimizing Metadata Representation In A Compressed Storage System 审中-公开
    最小化压缩存储系统中的元数据表示

    公开(公告)号:US20160004715A1

    公开(公告)日:2016-01-07

    申请号:US14321981

    申请日:2014-07-02

    CPC classification number: G06F3/0638 G06F3/0608 G06F3/0676

    Abstract: Embodiments of the invention relate to compressed storage systems, and reducing metadata representing compressed data. Compressed data is stored in units referred to as partitions, with each partition having a header that contains a virtual address of data stored in the partition. A linear function is providing to represent a mapping between a virtual address segment and a compressed data extent, with a slope of the function representing an associated compression ratio. A read operation is supported by consulting the mapping and using the mapping to locate the corresponding compressed extent. Similarly, a write operation is supported by writing a new segment, compressing content in the segment, and computing a new mapping of the compressed segment metadata in memory. The new mapping is represented in the linear function.

    Abstract translation: 本发明的实施例涉及压缩存储系统,并减少表示压缩数据的元数据。 压缩数据以被称为分区的单元存储,每个分区具有包含存储在分区中的数据的虚拟地址的报头。 提供线性函数来表示虚拟地址段和压缩数据范围之间的映射,其中该函数的斜率表示相关联的压缩比。 通过查看映射并使用映射来定位相应的压缩范围,支持读操作。 类似地,通过写入新段,压缩段中的内容以及计算存储器中的压缩段元数据的新映射来支持写入操作。 新的映射在线性函数中表示。

Patent Agency Ranking