Patents by Inventor Jian W. Zhang
Jian W. Zhang 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: 10303685Abstract: A method to optimize a database is provided. A processor determines a frequency of search for a plurality of columns in a table. A processor determines a length of the plurality of columns. A processor determines a rank for the plurality of columns based, at least in part, on both the frequency of search and the length of the plurality of columns. A processor generates a first set of combinations of the plurality of columns. A processor determines an optimization of the first set of combinations of the plurality of columns. A processor selects an optimal combination of the first set of combinations, wherein the optimization of the optimal combination is greater than the optimization for all other combinations in the first set of combinations. A processor moves the plurality of columns excluded from the optimal combination.Type: GrantFiled: June 8, 2015Date of Patent: May 28, 2019Assignee: International Business Machines CorporationInventors: Shuo Li, Shu Hua Liu, Xin Ying Yang, Jian W. Zhang
-
Patent number: 9904705Abstract: A computer system to optimize a database is provided. A processor determines a frequency of search for a plurality of columns in a table. A processor determines a length of the plurality of columns. A processor determines a rank for the plurality of columns based, at least in part, on both the frequency of search and the length of the plurality of columns. A processor generates a first set of combinations of the plurality of columns. A processor determines an optimization of the first set of combinations of the plurality of columns. A processor selects an optimal combination of the first set of combinations, wherein the optimization of the optimal combination is greater than the optimization for all other combinations in the first set of combinations. A processor moves the plurality of columns excluded from the optimal combination.Type: GrantFiled: January 17, 2017Date of Patent: February 27, 2018Assignee: International Business Machines CorporationInventors: Shuo Li, Shu Hua Liu, Xin Ying Yang, Jian W. Zhang
-
Publication number: 20170124149Abstract: A computer program product to optimize a database is provided. A processor determines a frequency of search for a plurality of columns in a table. A processor determines a length of the plurality of columns. A processor determines a rank for the plurality of columns based, at least in part, on both the frequency of search and the length of the plurality of columns. A processor generates a first set of combinations of the plurality of columns. A processor determines an optimization of the first set of combinations of the plurality of columns. A processor selects an optimal combination of the first set of combinations, wherein the optimization of the optimal combination is greater than the optimization for all other combinations in the first set of combinations. A processor moves the plurality of columns excluded from the optimal combination.Type: ApplicationFiled: January 17, 2017Publication date: May 4, 2017Inventors: Shuo Li, Shu Hua Liu, Xin Ying Yang, Jian W. Zhang
-
Patent number: 9633059Abstract: A computer program product to optimize a database is provided. A processor determines a frequency of search for a plurality of columns in a table. A processor determines a length of the plurality of columns. A processor determines a rank for the plurality of columns based, at least in part, on both the frequency of search and the length of the plurality of columns. A processor generates a first set of combinations of the plurality of columns. A processor determines an optimization of the first set of combinations of the plurality of columns. A processor selects an optimal combination of the first set of combinations, wherein the optimization of the optimal combination is greater than the optimization for all other combinations in the first set of combinations. A processor moves the plurality of columns excluded from the optimal combination.Type: GrantFiled: August 11, 2016Date of Patent: April 25, 2017Assignee: International Business Machines CorporationInventors: Shuo Li, Shu Hua Liu, Xin Ying Yang, Jian W. Zhang
-
Publication number: 20160357798Abstract: A computer program product to optimize a database is provided. A processor determines a frequency of search for a plurality of columns in a table. A processor determines a length of the plurality of columns. A processor determines a rank for the plurality of columns based, at least in part, on both the frequency of search and the length of the plurality of columns. A processor generates a first set of combinations of the plurality of columns. A processor determines an optimization of the first set of combinations of the plurality of columns. A processor selects an optimal combination of the first set of combinations, wherein the optimization of the optimal combination is greater than the optimization for all other combinations in the first set of combinations. A processor moves the plurality of columns excluded from the optimal combination.Type: ApplicationFiled: August 11, 2016Publication date: December 8, 2016Inventors: Shuo Li, Shu Hua Liu, Xin Ying Yang, Jian W. Zhang
-
Publication number: 20160357751Abstract: A method to optimize a database is provided. A processor determines a frequency of search for a plurality of columns in a table. A processor determines a length of the plurality of columns. A processor determines a rank for the plurality of columns based, at least in part, on both the frequency of search and the length of the plurality of columns. A processor generates a first set of combinations of the plurality of columns. A processor determines an optimization of the first set of combinations of the plurality of columns. A processor selects an optimal combination of the first set of combinations, wherein the optimization of the optimal combination is greater than the optimization for all other combinations in the first set of combinations. A processor moves the plurality of columns excluded from the optimal combination.Type: ApplicationFiled: June 8, 2015Publication date: December 8, 2016Inventors: Shuo Li, Shu Hua Liu, Xin Ying Yang, Jian W. Zhang
-
Patent number: 9430473Abstract: A method to optimize a database is provided. A processor determines a frequency of search for a plurality of columns in a table. A processor determines a length of the plurality of columns. A processor determines a rank for the plurality of columns based, at least in part, on both the frequency of search and the length of the plurality of columns. A processor generates a first set of combinations of the plurality of columns. A processor determines an optimization of the first set of combinations of the plurality of columns. A processor selects an optimal combination of the first set of combinations, wherein the optimization of the optimal combination is greater than the optimization for all other combinations in the first set of combinations. A processor moves the plurality of columns excluded from the optimal combination.Type: GrantFiled: December 22, 2015Date of Patent: August 30, 2016Assignee: International Business Machines CorporationInventors: Shuo Li, Shu Hua Liu, Xin Ying Yang, Jian W. Zhang