Patents by Inventor Yefim Shuf
Yefim Shuf 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: 10452793Abstract: In one example, a method for evaluating a system includes obtaining a model of the system that defines a boundary between at least one failure region and a non-failure region for a performance indicator with respect to at least one variable of the system. In one embodiment, obtaining the model involves constructing a new model; however, in other embodiments, obtaining the model involves accepting or retrieving a pre-constructed model is input. The method further includes obtaining importance samples for the at least one variable that are biased to the at least one failure region, and calculating indicator values for the performance indicator by applying the importance samples to the model.Type: GrantFiled: April 8, 2016Date of Patent: October 22, 2019Assignee: International Business Machines CorporationInventors: Rajiv V. Joshi, Yefim Shuf, Jonathan Sloan
-
Patent number: 10171311Abstract: A method of generating synthetic data from a model of a dataset comprises the steps of receiving a model of a dataset, extracting information from the received model, constructing a database view from the extracted information, receiving a query to the constructed database view, and generating synthetic data from the constructed database view according to the received query.Type: GrantFiled: October 17, 2013Date of Patent: January 1, 2019Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Matthew C. Harvey, Niall F. McCarroll, Yefim Shuf
-
Patent number: 10089379Abstract: A sequence of one or more input objects are sorted by identifying a property that is exhibited by a sequence of one or more input objects, determining whether each input object from the sequence of one or more input objects exhibits the property, storing each of the one or more input objects into a buffer, wherein an input object is stored in a first buffer if it exhibits the property and an input object is stored in a second buffer if it does not exhibit the property, sorting each of the one or more input objects in each buffer, and merging the one or more input objects in each buffer into a sequence of one or more input objects.Type: GrantFiled: August 18, 2008Date of Patent: October 2, 2018Assignee: International Business Machines CorporationInventors: Hong Min, Yefim Shuf, Hubertus Franke, Allan Benjamin Lebovitz, Christopher John Crone, Akiko Hoshikawa
-
Patent number: 9940113Abstract: Embodiments disclosed herein generally relate to techniques for managing processing of data in computing systems. One embodiment provides a method which includes receiving a set of inputs to apply to at least a first big data definition. Each big data definition encapsulates information specified in the set of inputs into a set of reusable software components. The method also includes generating, based on the reusable software components, a first executable code component for the at least first big data definition. The method further includes deploying the first executable code component to an executing application without interrupting services provided by the executing application to which the first executable code component is deployed.Type: GrantFiled: September 9, 2015Date of Patent: April 10, 2018Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: James D. Johnston, Ruiping Li, Sachin P. Sant, Yefim Shuf
-
Publication number: 20170068525Abstract: Embodiments disclosed herein generally relate to techniques for managing processing of data in computing systems. One embodiment provides a method which includes receiving a set of inputs to apply to at least a first big data definition. Each big data definition encapsulates information specified in the set of inputs into a set of reusable software components. The method also includes generating, based on the reusable software components, a first executable code component for the at least first big data definition. The method further includes deploying the first executable code component to an executing application without interrupting services provided by the executing application to which the first executable code component is deployed.Type: ApplicationFiled: September 9, 2015Publication date: March 9, 2017Inventors: James D. JOHNSTON, Ruiping Li, Sachin P. Sant, Yefim Shuf
-
Patent number: 9436721Abstract: The present disclosure relates generally to the field of determining data access patterns associated with different workloads. In various examples, determining data access patterns associated with different workloads may be implemented in the form of systems, methods and/or algorithms. The present disclosure also relates generally to the field of scheduling workloads (and/or recommending scheduling for workloads) based upon the determined data access patterns associated with the different workloads. In various examples, scheduling workloads (and/or recommending scheduling for workloads) may be implemented in the form of systems, methods and/or algorithms.Type: GrantFiled: February 28, 2014Date of Patent: September 6, 2016Assignee: International Business Machines CorporationInventors: Donna N. Dillenberger, Hubertus Franke, Hong Min, Yefim Shuf
-
Publication number: 20160224705Abstract: In one example, a method for evaluating a system includes obtaining a model of the system that defines a boundary between at least one failure region and a non-failure region for a performance indicator with respect to at least one variable of the system. In one embodiment, obtaining the model involves constructing a new model; however, in other embodiments, obtaining the model involves accepting or retrieving a pre-constructed model is input. The method further includes obtaining importance samples for the at least one variable that are biased to the at least one failure region, and calculating indicator values for the performance indicator by applying the importance samples to the model.Type: ApplicationFiled: April 8, 2016Publication date: August 4, 2016Inventors: Rajiv V. Joshi, Yefim Shuf, Jonathan Sloan
-
Patent number: 9235622Abstract: An apparatus and method for efficiently performing a query sort on a data set with duplicate key values is disclosed. The method includes identifying unique key values for a key in a data set after determining that a number of duplicate key values for the key exceed a predefined threshold. The method also includes recording an association of each unique key value with a record in the data set and sorting unique key values. The method further includes storing the unique key values in a sorted order, wherein each unique key value is associated with an appropriate record in the data set.Type: GrantFiled: February 27, 2009Date of Patent: January 12, 2016Assignee: International Business Machines CorporationInventors: Yefim Shuf, Hong Min, Hubertus Franke, Allan B. Lebovitz
-
Publication number: 20150248452Abstract: The present disclosure relates generally to the field of determining data access patterns associated with different workloads. In various examples, determining data access patterns associated with different workloads may be implemented in the form of systems, methods and/or algorithms. The present disclosure also relates generally to the field of scheduling workloads (and/or recommending scheduling for workloads) based upon the determined data access patterns associated with the different workloads. In various examples, scheduling workloads (and/or recommending scheduling for workloads) may be implemented in the form of systems, methods and/or algorithms.Type: ApplicationFiled: February 28, 2014Publication date: September 3, 2015Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Donna N. Dillenberger, Hubertus Franke, Hong Min, Yefim Shuf
-
Publication number: 20140115007Abstract: A method of generating synthetic data from a model of a dataset comprises the steps of receiving a model of a dataset, extracting information from the received model, constructing a database view from the extracted information, receiving a query to the constructed database view, and generating synthetic data from the constructed database view according to the received query.Type: ApplicationFiled: October 17, 2013Publication date: April 24, 2014Applicant: International Business Machines CorporationInventors: Matthew C. Harvey, Niall F. McCarroll, Yefim Shuf
-
Patent number: 8620899Abstract: Techniques for generating a set of one or more materialized query table (MQT) candidates for a workload are provided. The techniques include receiving a workload, wherein the workload comprises a set of one or more queries, generating one or more best matching MQTs (BMQTs) based on one or more query blocks of the one or more queries by removing syntax that is not qualified for a MQT re-write, determining one or more frequently used multi-joins in the workload, using the one or more BMQTs and the one or more frequently used multi-joins to generate a set of one or more workload MQTs (WMQTs), and grouping one or more WMQTs and one or more BMQTs into one or more groups to merge into a set of a smaller number of MQTs and to cover the workload.Type: GrantFiled: February 9, 2010Date of Patent: December 31, 2013Assignee: International Business Machines CorporationInventors: Dongsheng Chen, Hong Min, Terence P. Purcell, Yefim Shuf, Xiaobo Wang, Zhongliang Zhang
-
Patent number: 8359316Abstract: Techniques for database table look-up are provided. The techniques include storing one or more column attributes of a database table in a data structure, wherein the data structure also comprises a record identification (RID) column of a table, one or more predicate columns corresponding to the RID column, and a sequence number column that is associated with one or more updated records, generating a key using one or more portions from one or more of the one or more predicate columns, using the key to partition the data structure, wherein partitioning the data structure comprises partitioning the one or more predicate columns for evaluation, and evaluating the one or more predicate columns against the data structure for each matching predicate column-data structure partition.Type: GrantFiled: March 1, 2010Date of Patent: January 22, 2013Assignee: International Business Machines CorporationInventors: Hubertus Franke, You-Chin Fuh, Hong Min, Terence P. Purcell, Yefim Shuf
-
Patent number: 8190824Abstract: Systems and methods for cache replacement monitoring (CRM) are provided. The system includes a monitored cache comprising a monitored cache line set, the monitored cache line set comprising at least one cache line capable of holding data of a monitored address; and a CRM mechanism operatively associated with the monitored cache. The CRM mechanism collects CRM information for the monitored address. The method includes the steps of collecting CRM information for a monitored address in a monitored cache; and recording the CRM information for the monitored address, when at least one of (1) the monitored address is cached in the monitored cache, (2) the monitored address is replaced in the monitored cache, (3) any cache line in a cache line set corresponding to the monitored address is cached in the monitored cache, and (4) any cache line in a cache line set corresponding to the monitored address is replaced in the monitored cache.Type: GrantFiled: June 9, 2008Date of Patent: May 29, 2012Assignee: International Business Machines CorporationInventors: Xiaowei Shen, Yefim Shuf, Peter F. Sweeney
-
Patent number: 8140522Abstract: A database query is partitioned into an initial partition including a plurality of parallel groups, and is executed, via an execution plan, based on the initial partition. A sampling subset of data is identified from the plurality of parallel groups. Substantially in parallel with the executing of the query, the execution plan is executed on the sampling subset of data as a sampling thread. The execution plan is modified based on feedback from the execution of the execution plan on the sampling subset of data.Type: GrantFiled: August 12, 2008Date of Patent: March 20, 2012Assignee: International Business Machines CorporationInventors: Hong Min, Yefim Shuf, Terence Patrick Purcell, You-Chin Fuh, Chunfeng Pei, Ou Jin
-
Patent number: 8140979Abstract: A system and method for managing computer operations according to stored user preferences is disclosed. The system includes a calendar module for scheduling an event and centrally storing the user preferences regarding the computer operations during the event, and a controller module for retrieving the user preferences centrally stored in the calendar module and centrally controlling the computer operations according to the user preferences during the event.Type: GrantFiled: August 15, 2008Date of Patent: March 20, 2012Assignee: International Business Machines CorporationInventors: Yefim Shuf, Alex Zlatsin, Dimitri Kanevsky, Genady Grabarnik
-
Patent number: 8122219Abstract: Techniques for storage allocation of a data record are provided. The techniques include attempting to identify a first location for storing a data record, wherein the data record comprises one or more data record attributes, if the first location is identified, selecting the first location for storing the data record, and if the first location is not identified, identifying a second location for storing the data record using a cost penalty function and selecting the second location for storing the data record based on the cost penalty function.Type: GrantFiled: July 22, 2009Date of Patent: February 21, 2012Assignee: International Business Machines CorporationInventors: Yefim Shuf, Hong Min, Hubertus Franke, Ulrich Alfons Finkler
-
Publication number: 20110213775Abstract: Techniques for database table look-up are provided. The techniques include storing one or more column attributes of a database table in a data structure, wherein the data structure also comprises a record identification (RID) column of a table, one or more predicate columns corresponding to the RID column, and a sequence number column that is associated with one or more updated records, generating a key using one or more portions from one or more of the one or more predicate columns, using the key to partition the data structure, wherein partitioning the data structure comprises partitioning the one or more predicate columns for evaluation, and evaluating the one or more predicate columns against the data structure for each matching predicate column-data structure partition.Type: ApplicationFiled: March 1, 2010Publication date: September 1, 2011Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Hubertus Franke, You-Chin Fuh, Hong Min, Terence P. Purcell, Yefim Shuf
-
Publication number: 20110196857Abstract: Techniques for generating a set of one or more materialized query table (MQT) candidates for a workload are provided. The techniques include receiving a workload, wherein the workload comprises a set of one or more queries, generating one or more best matching MQTs (BMQTs) based on one or more query blocks of the one or more queries by removing syntax that is not qualified for a MQT re-write, determining one or more frequently used multi-joins in the workload, using the one or more BMQTs and the one or more frequently used multi-joins to generate a set of one or more workload MQTs (WMQTs), and grouping one or more WMQTs and one or more BMQTs into one or more groups to merge into a set of a smaller number of MQTs and to cover the workload.Type: ApplicationFiled: February 9, 2010Publication date: August 11, 2011Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Dong Sheng Chen, Hong Min, Terence P. Purcell, Yefim Shuf, Xiao Bo Wang, Zhong Liang Zhang
-
Patent number: 7930294Abstract: Techniques for partitioning a query are provided. The techniques include establishing one or more criterion for partitioning a query, wherein the query comprises one or more tables, materializing a first of the one or more tables, partitioning the first of the one or more tables until the one or more criterion have been satisfied, and partitioning and joining a remainder of the one or more tables of the query.Type: GrantFiled: August 12, 2008Date of Patent: April 19, 2011Assignee: International Business Machines CorporationInventors: Yefim Shuf, Hong Min, Terence Patrick Purcell, Ou Jin, Fen-Ling Lin, Brian Thinh-Vinh Tran, Patrick Dooling Bossman
-
Publication number: 20110022815Abstract: Techniques for storage allocation of a data record are provided. The techniques include attempting to identify a first location for storing a data record, wherein the data record comprises one or more data record attributes, if the first location is identified, selecting the first location for storing the data record, and if the first location is not identified, identifying a second location for storing the data record using a cost penalty function and selecting the second location for storing the data record based on the cost penalty function.Type: ApplicationFiled: July 22, 2009Publication date: January 27, 2011Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Yefim Shuf, Hong Min, Hubertus Franke, Ulrich Alfons Finkler