Patents by Inventor Yifat KUTTNER
Yifat KUTTNER 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: 10459641Abstract: For efficient serialization of journal data using a processor device, serialization is combined with journaling of data into one data storage system on a write operation with subsequent consolidation for serialization of the journal data.Type: GrantFiled: March 24, 2014Date of Patent: October 29, 2019Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Jonathan Amit, Yifat Kuttner, Sergey Marenkov, Ben Sasson
-
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: 9817865Abstract: Various embodiments for identifying data in a data deduplication system, by a processor device, are provided. In one embodiment, a method comprises efficiently identifying duplicate data in the data deduplication system by identifying fingerprint matches using a direct inter-region fingerprint lookup to search for the fingerprint matches in at least one of a plurality of metadata regions, the direct inter-region fingerprint lookup supplementing a central fingerprint index.Type: GrantFiled: December 7, 2015Date of Patent: November 14, 2017Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: David D. Chambliss, Jonathan Fischer-Toubol, Joseph S. Glider, Danny Harnik, Ety Khaitzin, Yifat Kuttner, Michael Moser, Yosef Shatsky
-
Patent number: 9696931Abstract: Methods, computing systems and computer program products implement embodiments of the present invention that include receiving a request to create a storage entity on a storage system, the storage entity including data and metadata, the metadata used to manage the storage entity. Upon receiving the request, multiple metadata attributes are identified for the metadata, and for each given identified metadata attribute, a respective metadata region is created on the storage system, and a subset of the metadata having the given metadata attribute is stored to the respective metadata region. Finally, a data region is created on the storage system, and the data is stored to the data region.Type: GrantFiled: June 12, 2015Date of Patent: July 4, 2017Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Yifat Kuttner, Sergey Marenkov, Ury Matarazzo, Yosef Shatsky
-
Publication number: 20170161329Abstract: Various embodiments for identifying data in a data deduplication system, by a processor device, are provided. In one embodiment, a method comprises efficiently identifying duplicate data in the data deduplication system by identifying fingerprint matches using a direct inter-region fingerprint lookup to search for the fingerprint matches in at least one of a plurality of metadata regions, the direct inter-region fingerprint lookup supplementing a central fingerprint index.Type: ApplicationFiled: December 7, 2015Publication date: June 8, 2017Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: David D. CHAMBLISS, Jonathan FISCHER-TOUBOL, Joseph S. GLIDER, Danny HARNIK, Ety KHAITZIN, Yifat KUTTNER, Michael MOSER, Yosef SHATSKY
-
Publication number: 20160364146Abstract: Methods, computing systems and computer program products implement embodiments of the present invention that include receiving a request to create a storage entity on a storage system, the storage entity including data and metadata, the metadata used to manage the storage entity. Upon receiving the request, multiple metadata attributes are identified for the metadata, and for each given identified metadata attribute, a respective metadata region is created on the storage system, and a subset of the metadata having the given metadata attribute is stored to the respective metadata region. Finally, a data region is created on the storage system, and the data is stored to the data region.Type: ApplicationFiled: June 12, 2015Publication date: December 15, 2016Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Yifat KUTTNER, Sergey MARENKOV, Ury MATARAZZO, Yosef SHATSKY
-
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
-
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
-
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: 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
-
Publication number: 20150268878Abstract: For efficient serialization of journal data using a processor device, serialization is combined with journaling of data into one data storage system on a write operation with subsequent consolidation for serialization of the journal data.Type: ApplicationFiled: March 24, 2014Publication date: September 24, 2015Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Jonathan AMIT, Yifat KUTTNER, Sergey MARENKOV, Ben SASSON
-
Publication number: 20150193487Abstract: 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: ApplicationFiled: January 6, 2014Publication date: July 9, 2015Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Lilia DEMIDOV, Nir HALOWANI, Yifat KUTTNER, Ben SASSON
-
Publication number: 20150193488Abstract: 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: ApplicationFiled: January 6, 2014Publication date: July 9, 2015Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Lilia DEMIDOV, Nir HALOWANI, Yifat KUTTNER, Ben SASSON