Patents by Inventor Nir HALOWANI

Nir HALOWANI 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: 9147374
    Abstract: 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.
    Type: Grant
    Filed: May 21, 2013
    Date of Patent: September 29, 2015
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Jonathan Amit, Lilia Demidov, Yakov Gerlovin, Nir Halowani, Sergey Marenkov
  • Patent number: 9141631
    Abstract: 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.
    Type: Grant
    Filed: April 16, 2012
    Date of Patent: September 22, 2015
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Jonathan Amit, Lilia Demidov, Nir Halowani
  • Publication number: 20150234852
    Abstract: 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, wherein a ratio is summed between the actual number of the characters and the expected number of the characters, and then dividing the ratio by a number of the data classes that are not empty, wherein the non-classifiable data are included in the number of the data classes during the dividing, and the number of the data classes, that are not empty, have characters that belong to the class that were observed in the input; and the classification-based compression is performed on the data candidates if the ratio exceeds a threshold.
    Type: Application
    Filed: May 5, 2015
    Publication date: August 20, 2015
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Jonathan AMIT, Lilia DEMIDOV, George GOLDBERG, Nir HALOWANI, Ronen I. KAT, Chaim KOIFMAN, Sergey MARENKOV, Dmitry SOTNIKOV
  • Publication number: 20150227565
    Abstract: 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.
    Type: Application
    Filed: February 11, 2014
    Publication date: August 13, 2015
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Jonathan AMIT, Nir HALOWANI, Chaim KOIFMAN, Shai TAHAR
  • Publication number: 20150227541
    Abstract: 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. A scanning operation is performed by searching a suffix of each of the sorted data streams for identifying a data sequence that includes a first symbol representing textual data, and a second symbol representing numerical data. The suffix tree for the converted data is then built.
    Type: Application
    Filed: April 23, 2015
    Publication date: August 13, 2015
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Jonathan AMIT, Lilia DEMIDOV, Nir HALOWANI
  • Publication number: 20150193488
    Abstract: 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.
    Type: Application
    Filed: January 6, 2014
    Publication date: July 9, 2015
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Lilia DEMIDOV, Nir HALOWANI, Yifat KUTTNER, Ben SASSON
  • Publication number: 20150193487
    Abstract: 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.
    Type: Application
    Filed: January 6, 2014
    Publication date: July 9, 2015
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Lilia DEMIDOV, Nir HALOWANI, Yifat KUTTNER, Ben SASSON
  • Patent number: 9053122
    Abstract: 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.
    Type: Grant
    Filed: November 7, 2013
    Date of Patent: June 9, 2015
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Jonathan Amit, Lilia Demidov, George Goldberg, Nir Halowani, Ronen I. Kat, Chaim Koifman, Sergey Marenkov, Dmitry Sotnikov
  • Patent number: 9053121
    Abstract: 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.
    Type: Grant
    Filed: January 10, 2013
    Date of Patent: June 9, 2015
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Jonathan Amit, Lilia Demidov, George Goldberg, Nir Halowani, Ronen I. Kat, Chaim Koifman, Sergey Marenkov, Dmitry Sotnikov
  • Patent number: 9043293
    Abstract: 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.
    Type: Grant
    Filed: March 7, 2013
    Date of Patent: May 26, 2015
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Jonathan Amit, Lilia Demidov, Nir Halowani
  • Publication number: 20150113220
    Abstract: Exemplary method, system, and computer program product embodiments for efficient one-pass cache-aware compression are provided. In one embodiment, by way of example only, an output of a fast compressor to Huffman encoding for achieving the one-pass cache-aware compression by using a predetermined Huffman-tree upon determining by the fast compressor a final representation of each data byte.
    Type: Application
    Filed: October 21, 2013
    Publication date: April 23, 2015
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Jonathan AMIT, Jonathan FISCHER-TOUBOL, Nir HALOWANI, Danny HARNIK, Ety KHAITZIN, Sergey MARENKOV, Gil SHAPIRA, Dmitry SOTNIKOV, Shai TAHAR
  • Patent number: 8903781
    Abstract: Exemplary method, system, and computer program product embodiments for real-time selection of compression operations are provided. In one embodiment, by way of example only, available compression operations are initialized according to an assigned success factor. The available compression operations are tested for determining if at least one of the compression operations yields a compression ratio greater than a minimal compression ratio. The available compression operations selected in real time for compressing at least one of the data blocks is applied. Additional system and computer program product embodiments are disclosed and provide related advantages.
    Type: Grant
    Filed: March 7, 2013
    Date of Patent: December 2, 2014
    Assignee: International Business Machines Corporation
    Inventors: Jonathan Amit, Lilia Demidov, Nir Halowani
  • Publication number: 20140347331
    Abstract: 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.
    Type: Application
    Filed: May 21, 2013
    Publication date: November 27, 2014
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Jonathan AMIT, Lilia DEMIDOV, Yakov GERLOVIN, Nir HALOWANI, Sergey MARENKOV
  • Patent number: 8898337
    Abstract: 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.
    Type: Grant
    Filed: October 27, 2011
    Date of Patent: November 25, 2014
    Assignee: International Business Machines Corporation
    Inventors: Lilia Demidov, Nir Halowani, Ori Shalev
  • Publication number: 20140195497
    Abstract: 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.
    Type: Application
    Filed: January 10, 2013
    Publication date: July 10, 2014
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Jonathan AMIT, Lilia DEMIDOV, George GOLDBERG, Nir HALOWANI, Ronen I. KAT, Chaim KOIFMAN, Sergey MARENKOV, Dmitry SOTNIKOV
  • Publication number: 20140195499
    Abstract: 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.
    Type: Application
    Filed: January 10, 2013
    Publication date: July 10, 2014
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Jonathan AMIT, Lilia DEMIDOV, George GOLDBERG, Nir HALOWANI, Danny HARNIK, Chaim KOIFMAN, Sergey MARENKOV, Oded MARGALIT, Kat I. RONEN, Dmitry SOTNIKOV
  • Publication number: 20140195500
    Abstract: 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.
    Type: Application
    Filed: November 7, 2013
    Publication date: July 10, 2014
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Jonathan AMIT, Lilia DEMIDOV, George GOLDBERG, Nir HALOWANI, Ronen I. KAT, Chaim KOIFMAN, Sergey MARENKOV, Dmitry SOTNIKOV
  • Patent number: 8682091
    Abstract: Exemplary method, system, and computer program product embodiments for real-time image recompression are provided. In one embodiment, by way of example only, compressed segments that are identified as having used at least one of a plurality of inefficient compression operations are partially decoded. The compressed segments are recompressed by employing context mapping. Additional system and computer program product embodiments are disclosed and provide related advantages.
    Type: Grant
    Filed: August 18, 2011
    Date of Patent: March 25, 2014
    Assignee: International Business Machines Corporation
    Inventors: Jonathan Amit, Lilia Demidov, Nir Halowani, Ori Shalev
  • Patent number: 8639673
    Abstract: For column compression of tabular data, similar type data segments are classified into classes for grouping the data segments into compression streams associated with each one of the classes. The compression streams are encoded based on a class-specific optimized encoding operation. The compression streams into one output buffer, wherein the compression streams are extracted.
    Type: Grant
    Filed: June 29, 2012
    Date of Patent: January 28, 2014
    Assignee: International Business Machines Corporation
    Inventors: Jonathan Amit, Lilia Demidov, Nir Halowani, Sergey Marenkov
  • Patent number: 8639672
    Abstract: For multiplexer classification for column compression of tabular data, similar type data segments are classified into classes for grouping the data segments into compression streams associated with each one of the classes. The compression streams are encoded based on a class-specific optimized encoding operation. The compression streams into one output buffer, wherein the compression streams are extracted.
    Type: Grant
    Filed: March 27, 2012
    Date of Patent: January 28, 2014
    Assignee: International Business Machines Corporation
    Inventors: Jonathan Amit, Lilia Demidov, Nir Halowani, Sergey Marenkov