Compression match enumeration
    1.
    发明授权
    Compression match enumeration 有权
    压缩匹配枚举

    公开(公告)号:US08493249B2

    公开(公告)日:2013-07-23

    申请号:US13152733

    申请日:2011-06-03

    IPC分类号: H03M7/00

    摘要: In embodiments of compression match enumeration, a suffix array can be generated that is representative of data sequences stored in a memory buffer. The suffix array can then be converted into a trie structure that overwrites the suffix array in the memory buffer as the trie structure is generated in-place of the suffix array. The trie structure includes nodes that each represent one or more suffixes of the suffix array, where each consecutive suffix is either grouped with an existing node in the trie structure or added as a new node of the trie structure. Data sequence matches can then be enumerated as determined from the trie structure.

    摘要翻译: 在压缩匹配枚举的实施例中,可以生成代表存储在存储器缓冲器中的数据序列的后缀阵列。 随后可以将后缀数组转换为一个特里结构,该结构将覆盖内存缓冲区中的后缀数组,因为该代码组合是由后缀数组生成的。 特里结构包括每个表示后缀数组的一个或多个后缀的节点,其中每个连续的后缀或者与特里结构中的现有节点分组或者作为特里结构的新节点添加。 然后可以从三维结构中确定数据序列匹配。

    COMPRESSED STORAGE MANAGEMENT
    5.
    发明申请
    COMPRESSED STORAGE MANAGEMENT 有权
    压缩存储管理

    公开(公告)号:US20090112949A1

    公开(公告)日:2009-04-30

    申请号:US11933364

    申请日:2007-10-31

    IPC分类号: G06F12/06

    摘要: In accordance with one or more aspects, compressed storage management in a system includes determining which of multiple data units stored in an uncompressed portion of the storage resource are to be compressed and stored in a compressed portion of the storage resource. The management can further include returning one or more regions of the compressed portion for use in the uncompressed portion in response to storage resource pressure in the system, as well as compacting regions in the compressed portion to fill empty gaps in the compressed portion.

    摘要翻译: 根据一个或多个方面,系统中的压缩存储管理包括确定存储在存储资源的未压缩部分中的多个数据单元中的哪个数据单元将被压缩并存储在存储资源的压缩部分中。 管理还可以包括响应于系统中的存储资源压力而返回压缩部分中用于未压缩部分的一个或多个区域,以及压缩压缩部分中的区域以填充压缩部分中的空隙。

    COMPRESSION MATCH ENUMERATION
    6.
    发明申请
    COMPRESSION MATCH ENUMERATION 有权
    压缩匹配计算

    公开(公告)号:US20120306670A1

    公开(公告)日:2012-12-06

    申请号:US13152733

    申请日:2011-06-03

    IPC分类号: H03M7/00

    摘要: In embodiments of compression match enumeration, a suffix array can be generated that is representative of data sequences stored in a memory buffer. The suffix array can then be converted into a trie structure that overwrites the suffix array in the memory buffer as the trie structure is generated in-place of the suffix array. The trie structure includes nodes that each represent one or more suffixes of the suffix array, where each consecutive suffix is either grouped with an existing node in the trie structure or added as a new node of the trie structure. Data sequence matches can then be enumerated as determined from the trie structure.

    摘要翻译: 在压缩匹配枚举的实施例中,可以生成代表存储在存储器缓冲器中的数据序列的后缀阵列。 随后可以将后缀数组转换为一个特里结构,该结构将覆盖内存缓冲区中的后缀数组,因为该代码组合是由后缀数组生成的。 特里结构包括每个表示后缀数组的一个或多个后缀的节点,其中每个连续的后缀或者与特里结构中的现有节点分组或者作为特里结构的新节点添加。 然后可以从三维结构中确定数据序列匹配。

    Compressed storage management
    8.
    发明授权
    Compressed storage management 有权
    压缩存储管理

    公开(公告)号:US07895242B2

    公开(公告)日:2011-02-22

    申请号:US11933364

    申请日:2007-10-31

    IPC分类号: G06F7/00 G06F17/30

    摘要: In accordance with one or more aspects, compressed storage management in a system includes determining which of multiple data units stored in an uncompressed portion of the storage resource are to be compressed and stored in a compressed portion of the storage resource. The management can further include returning one or more regions of the compressed portion for use in the uncompressed portion in response to storage resource pressure in the system, as well as compacting regions in the compressed portion to fill empty gaps in the compressed portion.

    摘要翻译: 根据一个或多个方面,系统中的压缩存储管理包括确定存储在存储资源的未压缩部分中的多个数据单元中的哪个数据单元将被压缩并存储在存储资源的压缩部分中。 管理还可以包括响应于系统中的存储资源压力而返回压缩部分中用于未压缩部分的一个或多个区域,以及压缩压缩部分中的区域以填充压缩部分中的空隙。