-
公开(公告)号：US10387376B2
公开(公告)日：2019-08-20
申请号：US15415203
申请日：2017-01-25
发明人： Jonathan Amit , Lilia Demidov , George Goldberg , Nir Halowani , Ronen I. Kat , Chaim Koifman , Sergey Marenkov , Dmitry Sotnikov
IPC分类号： G06F17/00 , G06F16/174 , G06F16/215 , G06F16/28 , G06F16/23
摘要： Identification of data candidates for data processing is performed in real time by a processor device in a computing environment. Data candidates are sampled for performing a classification-based compression upon the data candidates. A heuristic is computed on a randomly selected data sample from the data candidate, the heuristic computed by, for each one of the data classes, calculating an expected number of characters to be in a data class, calculating an expected number of characters that will not belong to a predefined set of the data classes, and calculating an actual number of the characters for each of the data classes and the non-classifiable data.
-
公开(公告)号：US09305041B2
公开(公告)日：2016-04-05
申请号：US14147999
申请日：2014-01-06
发明人： Lilia Demidov , Nir Halowani , Yifat Kuttner , Ben Sasson
IPC分类号： G06F17/30
CPC分类号： G06F17/30371 , G06F17/30327 , G06F17/30595 , H03M7/3086 , H03M7/4031 , H03M7/405 , H03M7/70
摘要： B-Tree data is serialized to existing data for all types of workloads. The serialized B-Tree data, that has been split, sorted and classified into identified data ranges, is then compressed.
摘要翻译： 将B-Tree数据序列化为所有类型工作负载的现有数据。 已经被分割，分类和分类为标识的数据范围的序列化B-Tree数据被压缩。
-
3.发明授权公开(公告)号：US09053122B2
公开(公告)日：2015-06-09
申请号：US14074053
申请日：2013-11-07
发明人： Jonathan Amit , Lilia Demidov , George Goldberg , Nir Halowani , Ronen I. Kat , Chaim Koifman , Sergey Marenkov , Dmitry Sotnikov
CPC分类号： G06F17/30371 , G06F17/30153 , G06F17/30303 , G06F17/30598
摘要： Identification of data candidates for data processing is performed in real time by a processor device in a computing environment. Data candidates are sampled for performing a classification-based compression upon the data candidates. A heuristic is computed on a randomly selected data sample from the data candidate for determining if the data candidate may benefit from the classification-based compression. A decision is provided for approving the classification-based compression on the data candidates according to the heuristic.
摘要翻译： 用于数据处理的数据候选的识别由计算环境中的处理器设备实时执行。 对数据候选进行采样以对数据候选进行基于分类的压缩。 对来自数据候选者的随机选择的数据样本计算启发式，以确定数据候选者是否可以受益于基于分类的压缩。 提供了一种决定，根据启发式来批准基于分类的压缩数据候选。
-
公开(公告)号：US09147374B2
公开(公告)日：2015-09-29
申请号：US13898690
申请日：2013-05-21
发明人： Jonathan Amit , Lilia Demidov , Yakov Gerlovin , Nir Halowani , Sergey Marenkov
CPC分类号： G06T9/00 , G09G5/00 , H03M7/6064 , H03M7/6082 , H04N7/00 , H04N13/00
摘要： A detection learning module is used for enabling and/or disabling real-time compression detection by maintaining a history of real-time compression detection success for sampled data. The enabling or disabling of the real-time compression detection is based on a detection benefit function derived from a set of calculated heuristics indicating the real-time compression detection success on input streams.
摘要翻译： 检测学习模块用于通过维持对采样数据的实时压缩检测成功的历史来启用和/或禁用实时压缩检测。 启用或禁用实时压缩检测是基于从表示输入流上的实时压缩检测成功的一组计算的启发式导出的检测有益功能。
-
公开(公告)号：US09043293B2
公开(公告)日：2015-05-26
申请号：US13789254
申请日：2013-03-07
发明人： Jonathan Amit , Lilia Demidov , Nir Halowani
CPC分类号： G06F17/30371 , G06F17/30153 , G06F17/30327 , G06F17/30528 , G06F17/30569 , G06F17/30864 , H03M7/30
摘要： Data is converted into a minimized data representation using a suffix tree by sorting data streams according to symbolic representations for building table boundary formation patterns. The converted data is fully reversible for reconstruction while retaining minimal header information.
-
公开(公告)号：US09947113B2
公开(公告)日：2018-04-17
申请号：US14839417
申请日：2015-08-28
发明人： Jonathan Amit , Lilia Demidov , Yakov Gerlovin , Nir Halowani , Sergey Marenkov
CPC分类号： G06T9/00 , G09G5/00 , H03M7/6064 , H03M7/6082 , H04N7/00 , H04N13/00
摘要： A detection learning module is used for enabling and/or disabling real-time compression detection by maintaining a history of real-time compression detection success for sampled data. The enabling or disabling of the real-time compression detection is based on a detection benefit function derived from a set of calculated heuristics indicating the real-time compression detection success on input streams. The detection benefit function is calculated based on at least one heuristic score.
-
公开(公告)号：US09792350B2
公开(公告)日：2017-10-17
申请号：US13738333
申请日：2013-01-10
发明人： Jonathan Amit , Lilia Demidov , George Goldberg , Nir Halowani , Danny Harnik , Chaim Koifman , Sergey Marenkov , Oded Margalit , Kat I. Ronen , Dmitry Sotnikov
CPC分类号： G06F17/30598 , G06F17/30315
摘要： For real-time classification of data into data compression domains, a decision is made for which of the data compression domains write operations should be forwarded by reading randomly selected data of the write operations for computing a set of classifying heuristics thereby creating a fingerprint for each of the write operations. The write operations having a similar fingerprint are compressed together in a similar compression stream.
-
公开(公告)号：US09305040B2
公开(公告)日：2016-04-05
申请号：US14147972
申请日：2014-01-06
发明人： Lilia Demidov , Nir Halowani , Yifat Kuttner , Ben Sasson
IPC分类号： G06F17/30
CPC分类号： G06F17/30327 , G06F17/30336
摘要： B-Tree data is serialized to existing data for all types of workloads by converting a B-Tree data structure into a format capable of being stored and resurrected while containing all data stored in the B-Tree data structure and information relating to the B-Tree data structure.
摘要翻译： 通过将B-Tree数据结构转换为能够存储和复活的格式，同时包含存储在B-Tree数据结构中的所有数据和与B-Tree数据结构相关的信息，将B-Tree数据序列化为所有类型工作负载的现有数据。 树数据结构。
-
公开(公告)号：US10423596B2
公开(公告)日：2019-09-24
申请号：US14177690
申请日：2014-02-11
发明人： Jonathan Amit , Nir Halowani , Chaim Koifman , Shai Tahar
摘要： A Huffman cache is used to hold Huffman dictionaries that are changeable for dynamically selecting literal frequencies that are similar, wherein the Huffman cache is a data storage cache.
-
公开(公告)号：US10248676B2
公开(公告)日：2019-04-02
申请号：US15082785
申请日：2016-03-28
发明人： Lilia Demidov , Nir Halowani , Yifat Kuttner , Ben Sasson
IPC分类号： G06F17/30
摘要： B-Tree data is serialized to existing data for all types of workloads by converting a B-Tree data structure into a format capable of being stored and resurrected while containing all data stored in the B-Tree data structure and information relating to the B-Tree data structure. The serialized B-Tree data is divided into a plurality of sections. The serialized B-Tree data is stored into a plurality of buffers, where storing the B-Tree information section in a first binary buffer, the B-Tree key section in a second binary buffer, and the B-Tree data section in a third binary buffer. In the B-Tree data section, B-Tree data elements stored in the B-Tree data structure are saved, where a size of the B-Tree data section is equal to a total number of the B-Tree data elements in the B-Tree data structure multiplied by a size of each of the B-Tree data elements.
-
-
-
-
-
-
-
-
-
搜索结果
18 条记录 (耗时 0.016 秒)
