EFFICIENT DATA COMPRESSION AND ANALYSIS AS A SERVICE
    31.
    发明申请
    EFFICIENT DATA COMPRESSION AND ANALYSIS AS A SERVICE 有权
    有效的数据压缩和分析作为服务

    公开(公告)号:US20140351229A1

    公开(公告)日:2014-11-27

    申请号:US13900350

    申请日:2013-05-22

    IPC分类号: G06F17/30

    摘要: Data may be efficiently analyzed and compressed as part of a data compression service. A data compression request may be received from a client indicating data to be compressed. An analysis of the data or metadata associated with the data may be performed. In at least some embodiments, this analysis may be a rules-based analysis. Some embodiments may employ one or more machine learning techniques to historical compression data to update the rules-based analysis. One or more compression techniques may be selected out of a plurality of compression techniques to be applied to the data. Data compression candidates may then be generated according to the selected compression techniques. In some embodiments, a compression service restriction may be enforced. One of the data compression candidates may be selected and sent in a response.

    摘要翻译: 数据可以作为数据压缩服务的一部分被有效地分析和压缩。 可以从客户端接收指示要压缩的数据的数据压缩请求。 可以执行与数据相关联的数据或元数据的分析。 在至少一些实施例中,该分析可以是基于规则的分析。 一些实施例可以对历史压缩数据采用一种或多种机器学习技术来更新基于规则的分析。 可以从应用于数据的多种压缩技术中选择一种或多种压缩技术。 然后可以根据选择的压缩技术生成数据压缩候选。 在一些实施例中,可以强制执行压缩服务限制。 可以在响应中选择并发送其中一个数据压缩候选。

    REAL-TIME REDUCTION OF CPU OVERHEAD FOR DATA COMPRESSION
    32.
    发明申请
    REAL-TIME REDUCTION OF CPU OVERHEAD FOR DATA COMPRESSION 有权
    CPU实时缩减数据压缩

    公开(公告)号:US20140195498A1

    公开(公告)日:2014-07-10

    申请号:US13738300

    申请日:2013-01-10

    IPC分类号: H03M7/30

    摘要: Real-time reduction of CPU overhead for data compression is performed by a processor device in a computing environment. Non-compressing heuristics are applied on a randomly selected data sample from data sequences for determining whether to compress the data sequences. A compression potential is calculated based on the non-compressing heuristics. The compression potential is compared to a threshold value. The data sequences are either compressed if the compress threshold is matched, compressed using Huffman coding if Huffman coding threshold is matched, or stored without compression.

    摘要翻译: 用于数据压缩的CPU开销的实时降低由计算环境中的处理器设备执行。 将非压缩启发式应用于从数据序列中随机选择的数据样本,以确定是否压缩数据序列。 基于非压缩启发式计算压缩电位。 将压缩电位与阈值进行比较。 如果压缩阈值匹配,则数据序列被压缩,如果霍夫曼编码阈值匹配则使用霍夫曼编码进行压缩,或者不压缩地存储。

    METHOD FOR ADAPTIVE ENTROPY CODING OF TREE STRUCTURES
    33.
    发明申请
    METHOD FOR ADAPTIVE ENTROPY CODING OF TREE STRUCTURES 有权
    树结构的自适应熵编码方法

    公开(公告)号:US20140185668A1

    公开(公告)日:2014-07-03

    申请号:US14233519

    申请日:2011-07-18

    IPC分类号: H04N19/96 H04N19/44

    摘要: In 3D mesh coding, the geometry data is compressed by spatial tree based approaches. Bitstreams that result from the traversal of a tree structure of spatial tree based approaches for encoding 3D mesh models have systematically special redundancies, which is exploited for further improving the mesh model compression. A method for encoding a bitstream comprises steps of defining at least a first and a second symbol group of binary symbols, with S1 being a subset of S2, determining within the bitstream first portions, second portions and third portions, wherein first portions have Th1 or more consecutive S1 symbols and second portions have Th2 or more consecutive S2 symbols, encoding the bitstream, wherein first portions, second portions and third portions are encoded using different codes, and encoding values indicating the boundary positions between the first, second and third portions in the bitstream.

    摘要翻译: 在3D网格编码中,几何数据通过基于空间树的方法进行压缩。 通过遍历基于空间树的基于空间树的编码3D网格模型的方法产生的位流具有系统的特殊冗余,被用于进一步改进网格模型压缩。 一种用于编码比特流的方法包括以下步骤:定义二进制符号的至少第一和第二符号组,其中S1是S2的子集,在比特流第一部分,第二部分和第三部分内确定其中第一部分具有Th1或 更连续的S1符号和第二部分具有Th2或更多个连续的S2符号,对比特流进行编码,其中使用不同的代码对第一部分,第二部分和第三部分进行编码,并且编码指示第一,第二和第三部分之间的边界位置的值 比特流。

    Real-time multi-block lossless recompression

    公开(公告)号:US08578058B2

    公开(公告)日:2013-11-05

    申请号:US13044396

    申请日:2011-03-09

    IPC分类号: G06F15/16

    摘要: Exemplary methods, computer systems, and computer program products for processing a previously compressed data stream in a computer environment are provided. In one embodiment, the computer environment is configured for separating a previously compressed data stream into an input data block including a header input block having a previously compressed header. Sequences of bits are included with the input data block. Compression scheme information is derived from the previously compressed header. The input data block is accessed and recompressed following the header input block in the previously compressed data stream one at a time using block-image synchronization information. Access to the block-image synchronization information is initialized by the compression scheme information to generate an output data block. The block-image synchronization information is used to provide decompression information to facilitate decompression of the results of the output data block.

    METHOD AND DEVICE OF JUDGING COMPRESSED DATA AND DATA STORAGE DEVICE INCLUDING THE SAME
    35.
    发明申请
    METHOD AND DEVICE OF JUDGING COMPRESSED DATA AND DATA STORAGE DEVICE INCLUDING THE SAME 审中-公开
    评估压缩数据的方法和装置以及包括其的数据存储装置

    公开(公告)号:US20120144148A1

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

    申请号:US13241352

    申请日:2011-09-23

    IPC分类号: G06F12/00

    摘要: A write method of a data storage device including a storage media includes receiving data to be stored in the storage media; judging whether the received data is compressed data, without externally provided additional information; and selectively compressing the received data according to the judgment result, wherein the judging whether the received data is compressed data is made based on a distribution of actual symbols included in at least part of the received data.

    摘要翻译: 包括存储介质的数据存储设备的写入方法包括接收要存储在存储介质中的数据; 判断接收到的数据是否为压缩数据,无需外部提供的附加信息; 以及根据判断结果选择性地压缩接收到的数据,其中基于包含在所接收的数据的至少一部分中的实际符号的分布来判断所接收的数据是否是压缩数据。

    REAL-TIME MULTI-BLOCK LOSSLESS RECOMPRESSION

    公开(公告)号:US20120045142A1

    公开(公告)日:2012-02-23

    申请号:US13282991

    申请日:2011-10-27

    IPC分类号: G06K9/36

    摘要: Exemplary methods, computer systems, and computer program products for processing a previously compressed data stream in a computer environment are provided. In one embodiment, the computer environment is configured for separating a previously compressed data stream into an input data block including a header input block having a previously compressed header. Sequences of bits are included with the input data block. Compression scheme information is derived from the previously compressed header. The input data block is accessed and recompressed following the header input block in the previously compressed data stream one at a time using block-image synchronization information. Access to the block-image synchronization information is initialized by the compression scheme information to generate an output data block. The block-image synchronization information is used to provide decompression information to facilitate decompression of the results of the output data block.

    REAL-TIME MULTI-BLOCK LOSSLESS RECOMPRESSION
    37.
    发明申请
    REAL-TIME MULTI-BLOCK LOSSLESS RECOMPRESSION 有权
    实时多路径无噪声恢复

    公开(公告)号:US20120045139A1

    公开(公告)日:2012-02-23

    申请号:US13282987

    申请日:2011-10-27

    IPC分类号: G06K9/36

    摘要: Exemplary methods, computer systems, and computer program products for processing a previously compressed data stream in a computer environment are provided. In one embodiment, the computer environment is configured for separating a previously compressed data stream into an input data block including a header input block having a previously compressed header. Sequences of bits are included with the input data block. Compression scheme information is derived from the previously compressed header. The input data block is accessed and recompressed following the header input block in the previously compressed data stream one at a time using block-image synchronization information. Access to the block-image synchronization information is initialized by the compression scheme information to generate an output data block. The block-image synchronization information is used to provide decompression information to facilitate decompression of the results of the output data block.

    摘要翻译: 提供了用于在计算机环境中处理先前压缩的数据流的示例性方法,计算机系统和计算机程序产品。 在一个实施例中,计算机环境被配置为将先前压缩的数据流分离成包括具有先前压缩的报头的报头输入块的输入数据块。 位的序列包含在输入数据块中。 压缩方案信息是从先前压缩的报头导出的。 在先前压缩的数据流中的标题输入块之后,使用块图像同步信息一次一个地访问和重新压缩输入数据块。 通过压缩方案信息初始化对块图像同步信息的访问,以生成输出数据块。 块图像同步信息用于提供解压缩信息以便于解压缩输出数据块的结果。

    Method for optimizing data compression and throughput
    38.
    发明授权
    Method for optimizing data compression and throughput 失效
    优化数据压缩和吞吐量的方法

    公开(公告)号:US5936559A

    公开(公告)日:1999-08-10

    申请号:US871403

    申请日:1997-06-09

    申请人: Paul Glor Howard

    发明人: Paul Glor Howard

    IPC分类号: H03M7/00

    CPC分类号: H03M7/4006 H03M7/6088

    摘要: A method provides for the interleaving of arithmetic codes with either other codes, non-coded data or other arithmetically coded data. A method provides for reserving portions of a data stream for the first arithmetically coded data and interspersing the second coded data amongst the portions of the data stream reserved for the first arithmetic coder.

    摘要翻译: 一种方法提供算术代码与其他代码,非编码数据或其他算术编码数据的交织。 一种方法提供用于保留用于第一算术编码数据的数据流的部分并且在为第一算术编码器保留的数据流的部分之间散布第二编码数据。

    Hardware data compressor using dynamic hash algorithm based on input block type

    公开(公告)号:US09768803B2

    公开(公告)日:2017-09-19

    申请号:US15258867

    申请日:2016-09-07

    IPC分类号: H03M7/34 H03M7/42 H03M7/30

    摘要: A hardware data compressor that compresses an input block of characters by replacing strings of characters in the input block with back pointers to matching strings earlier in the input block. A hash table is used in searching for the matching strings in the input block. A plurality of hash index generators each employs a different hashing algorithm on an initial portion of the strings of characters to be replaced to generate a respective index. The hardware data compressor also includes an indication of a type of the input block of characters. A selector selects the index generated by of one of the plurality hash index generators to index into the hash table based on the type of the input block.

    Method for adaptive entropy coding of tree structures
    40.
    发明授权
    Method for adaptive entropy coding of tree structures 有权
    树结构自适应熵编码方法

    公开(公告)号:US09532056B2

    公开(公告)日:2016-12-27

    申请号:US14233519

    申请日:2011-07-18

    摘要: In 3D mesh coding, the geometry data is compressed by spatial tree based approaches. Bitstreams that result from the traversal of a tree structure of spatial tree based approaches for encoding 3D mesh models have systematically special redundancies, which is exploited for further improving the mesh model compression. A method for encoding a bitstream comprises steps of defining at least a first and a second symbol group of binary symbols, with S1 being a subset of S2, determining within the bitstream first portions, second portions and third portions, wherein first portions have Th1 or more consecutive S1 symbols and second portions have Th2 or more consecutive S2 symbols, encoding the bitstream, wherein first portions, second portions and third portions are encoded using different codes, and encoding values indicating the boundary positions between the first, second and third portions in the bitstream.

    摘要翻译: 在3D网格编码中,几何数据通过基于空间树的方法进行压缩。 通过遍历基于空间树的基于空间树的编码3D网格模型的方法产生的位流具有系统的特殊冗余,被用于进一步改进网格模型压缩。 一种用于编码比特流的方法包括以下步骤:定义二进制符号的至少第一和第二符号组,其中S1是S2的子集,在比特流第一部分,第二部分和第三部分内确定其中第一部分具有Th1或 更连续的S1符号和第二部分具有Th2个或更多个连续的S2符号,对比特流进行编码,其中使用不同的代码对第一部分,第二部分和第三部分进行编码,并且编码指示第一,第二和第三部分之间的边界位置的值 比特流。