Patents by Inventor Lilia DEMIDOV
Lilia DEMIDOV 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: 10387376Abstract: 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.Type: GrantFiled: January 25, 2017Date of Patent: August 20, 2019Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Jonathan Amit, Lilia Demidov, George Goldberg, Nir Halowani, Ronen I. Kat, Chaim Koifman, Sergey Marenkov, Dmitry Sotnikov
-
Patent number: 10289714Abstract: B-Tree data is serialized to existing data for all types of workloads. Each of an identified data range is encoded with frequency encoding, wherein a first value in a frequency encoded identified data range is a first value in original data and all subsequent values in the frequency encoded identified data range are equal to a difference between a corresponding value in an input file and a previous value in the input file.Type: GrantFiled: March 28, 2016Date of Patent: May 14, 2019Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Lilia Demidov, Nir Halowani, Yifat Kuttner, Ben Sasson
-
Patent number: 10248676Abstract: 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.Type: GrantFiled: March 28, 2016Date of Patent: April 2, 2019Assignee: INTERNATIONAL BUSINESS MACHIENS CORPORATIONInventors: Lilia Demidov, Nir Halowani, Yifat Kuttner, Ben Sasson
-
Patent number: 9947113Abstract: 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.Type: GrantFiled: August 28, 2015Date of Patent: April 17, 2018Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Jonathan Amit, Lilia Demidov, Yakov Gerlovin, Nir Halowani, Sergey Marenkov
-
Patent number: 9792350Abstract: 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: GrantFiled: January 10, 2013Date of Patent: October 17, 2017Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Jonathan Amit, Lilia Demidov, George Goldberg, Nir Halowani, Danny Harnik, Chaim Koifman, Sergey Marenkov, Oded Margalit, Kat I. Ronen, Dmitry Sotnikov
-
Publication number: 20170132273Abstract: 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.Type: ApplicationFiled: January 25, 2017Publication date: May 11, 2017Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Jonathan AMIT, Lilia DEMIDOV, George GOLDBERG, Nir HALOWANI, Ronen I. KAT, Chaim KOIFMAN, Sergey MARENKOV, Dmitry SOTNIKOV
-
Patent number: 9588980Abstract: Identification of data candidates for data processing is performed in real time by a processor device in a distributed 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.Type: GrantFiled: June 22, 2015Date of Patent: March 7, 2017Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Jonathan Amit, Lilia Demidov, George Goldberg, Nir Halowani, Ronen I. Kat, Chaim Koifman, Sergey Marenkov, Dmitry Sotnikov
-
Patent number: 9514179Abstract: 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: GrantFiled: September 8, 2015Date of Patent: December 6, 2016Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Jonathan Amit, Lilia Demidov, Nir Halowani
-
Patent number: 9514178Abstract: 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: GrantFiled: April 23, 2015Date of Patent: December 6, 2016Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Jonathan Amit, Lilia Demidov, Nir Halowani
-
Publication number: 20160210325Abstract: B-Tree data is serialized to existing data for all types of workloads. Each of an identified data range is encoded with frequency encoding, wherein a first value in a frequency encoded identified data range is a first value in original data and all subsequent values in the frequency encoded identified data range are equal to a difference between a corresponding value in an input file and a previous value in the input file.Type: ApplicationFiled: March 28, 2016Publication date: July 21, 2016Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Lilia DEMIDOV, Nir HALOWANI, Yifat KUTTNER, Ben SASSON
-
Publication number: 20160210319Abstract: 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.Type: ApplicationFiled: March 28, 2016Publication date: July 21, 2016Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Lilia DEMIDOV, Nir HALOWANI, Yifat KUTTNER, Ben SASSON
-
Patent number: 9305040Abstract: 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: GrantFiled: January 6, 2014Date of Patent: April 5, 2016Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Lilia Demidov, Nir Halowani, Yifat Kuttner, Ben Sasson
-
Patent number: 9305041Abstract: 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: GrantFiled: January 6, 2014Date of Patent: April 5, 2016Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Lilia Demidov, Nir Halowani, Yifat Kuttner, Ben Sasson
-
Patent number: 9239842Abstract: 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: GrantFiled: May 5, 2015Date of Patent: January 19, 2016Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Jonathan Amit, Lilia Demidov, George Goldberg, Nir Halowani, Ronen I. Kat, Chaim Koifman, Sergey Marenkov, Dmitry Sotnikov
-
Publication number: 20150379068Abstract: 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: ApplicationFiled: September 8, 2015Publication date: December 31, 2015Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Jonathan AMIT, Lilia DEMIDOV, Nir HALOWANI
-
Publication number: 20150371406Abstract: 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.Type: ApplicationFiled: August 28, 2015Publication date: December 24, 2015Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Jonathan AMIT, Lilia DEMIDOV, Yakov GERLOVIN, Nir HALOWANI, Sergey MARENKOV
-
Publication number: 20150317381Abstract: Identification of data candidates for data processing is performed in real time by a processor device in a distributed 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.Type: ApplicationFiled: June 22, 2015Publication date: November 5, 2015Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Jonathan AMIT, Lilia DEMIDOV, George GOLDBERG, Nir HALOWANI, Ronen I. KAT, Chaim KOIFMAN, Sergey MARENKOV, Dmitry SOTNIKOV
-
Patent number: 9147374Abstract: 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: GrantFiled: May 21, 2013Date of Patent: September 29, 2015Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Jonathan Amit, Lilia Demidov, Yakov Gerlovin, Nir Halowani, Sergey Marenkov
-
Patent number: 9141631Abstract: 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: GrantFiled: April 16, 2012Date of Patent: September 22, 2015Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Jonathan Amit, Lilia Demidov, Nir Halowani
-
Publication number: 20150234852Abstract: 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: ApplicationFiled: May 5, 2015Publication date: August 20, 2015Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Jonathan AMIT, Lilia DEMIDOV, George GOLDBERG, Nir HALOWANI, Ronen I. KAT, Chaim KOIFMAN, Sergey MARENKOV, Dmitry SOTNIKOV