Patents by Inventor Xin Ying Yang

Xin Ying Yang 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).

  • Publication number: 20190294601
    Abstract: In an approach for optimizing query executions a processor receives a request to transfer data from a first table to a second table. A processor detects a relationship between the first table and the second table, wherein the relationship is based on a similarity between the first table and the second table. A processor identifies at least a first access path for transferring the data from the first table to the second table. A processor calculates a first cost of transferring the data from the first table to the second table using the first access path based on the similarity between the first table and the second table, wherein the first cost indicates estimated processor usage to transfer the data.
    Type: Application
    Filed: May 8, 2019
    Publication date: September 26, 2019
    Inventors: Shuo Li, Ping Liang, Kewei Wei, Xin Ying Yang
  • Patent number: 10423462
    Abstract: Embodiments of the present invention provide systems and methods for dynamically allocating data to multiple nodes. The method includes determining the usage of multiple buffers and the capability factors of multiple servers. Data is then allocated to multiple buffers associated with multiple active servers, based on the determined usage and capability factors, in order to keep the processing load on the multiple servers balanced.
    Type: Grant
    Filed: February 9, 2016
    Date of Patent: September 24, 2019
    Assignee: International Business Machines Corporation
    Inventors: Mi W. Shum, DongJie Wei, Samuel H. K. Wong, Xin Ying Yang, Xiang Zhou
  • Publication number: 20190266144
    Abstract: In an approach for optimizing query executions a processor receives a request to transfer data from a first table to a second table. A processor detects a relationship between the first table and the second table, wherein the relationship is based on a similarity between the first table and the second table. A processor identifies at least a first access path for transferring the data from the first table to the second table. A processor calculates a first cost of transferring the data from the first table to the second table using the first access path based on the similarity between the first table and the second table, wherein the first cost indicates estimated processor usage to transfer the data.
    Type: Application
    Filed: May 8, 2019
    Publication date: August 29, 2019
    Inventors: Shuo Li, Ping Liang, Kewei Wei, Xin Ying Yang
  • Publication number: 20190258639
    Abstract: A tool for combining common processes shared by at least two or more sub-queries within a query is provided. The tool determines whether one or more sub set relationships are shared between the at least two or more sub-queries. Responsive to a determination that one or more sub set relationships are shared between the at least two or more sub-queries, the tool determines an order class for the at least two or more sub-queries based on the one or more sub set relationships, wherein determining the order class includes transforming the query to include one or more differing aspects within the single shared common process, with the one or more differing aspects arranged based, at least in part, on a query style, a query type, and a query function. Responsive to determining an access path for the query, the tool executes the access path during run-time for data accessing.
    Type: Application
    Filed: May 3, 2019
    Publication date: August 22, 2019
    Inventors: Shuo Li, Meng Wan, Xiaobo Wang, Xin Ying Yang
  • Patent number: 10380108
    Abstract: In an approach to determining an access method for a partition in a partition table, a computer receives a query and determines if there is a partition table utilized by the query. When there is a partition table utilized by the query, then the computer determines that a partition in the partition table meets the plurality of conditions of the query. The computer collects a plurality of partition level statistics for the partition that meets the plurality of conditions of the query. Additionally, the computer determines, based, at least in part, on the plurality of partition level statistics, a cost for one or more access methods for the partition that meets the plurality of conditions of the query. Furthermore, the computer determines, based, at least in part, on the cost for each access method, an access method for the partition that meets the plurality of conditions of the query.
    Type: Grant
    Filed: June 22, 2015
    Date of Patent: August 13, 2019
    Assignee: International Business Machines Corporation
    Inventors: Shuo Li, Ping Liang, Ke Wei Wei, Xin Ying Yang
  • Patent number: 10331646
    Abstract: In an approach for optimizing query executions a processor receives a request to transfer data from a first table to a second table. A processor detects a relationship between the first table and the second table, wherein the relationship is based on a similarity between the first table and the second table. A processor identifies at least a first access path for transferring the data from the first table to the second table. A processor calculates a first cost of transferring the data from the first table to the second table using the first access path based on the similarity between the first table and the second table, wherein the first cost indicates estimated processor usage to transfer the data.
    Type: Grant
    Filed: May 10, 2016
    Date of Patent: June 25, 2019
    Assignee: International Business Machines Corporation
    Inventors: Shuo Li, Ping Liang, Kewei Wei, Xin Ying Yang
  • Patent number: 10324931
    Abstract: A tool for combining common processes shared by at least two or more sub-queries within a query is provided. The tool determines the query with the at least two or more sub-queries. The tool determines whether one or more sub set relationships are shared between the at least two or more sub-queries. Responsive to a determination that one or more sub set relationships are shared between the at least two or more sub-queries, the tool determines an order class for the at least two or more sub-queries based on the one or more sub set relationships. The tool determines an access path for the query. The tool executes the access path during run-time for data accessing.
    Type: Grant
    Filed: February 5, 2016
    Date of Patent: June 18, 2019
    Assignee: International Business Machines Corporation
    Inventors: Shuo Li, Meng Wan, Xiaobo Wang, Xin Ying Yang
  • Patent number: 10303685
    Abstract: 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: Grant
    Filed: June 8, 2015
    Date of Patent: May 28, 2019
    Assignee: International Business Machines Corporation
    Inventors: Shuo Li, Shu Hua Liu, Xin Ying Yang, Jian W. Zhang
  • Patent number: 10296624
    Abstract: A method for curating documents, executed by a computer, includes detecting one or more themes in a document, identifying one or more user interests for a user, presenting a ranked list of the one or more themes to the user, and dynamically updating the ranked list based on user feedback. The ranked list may be ranked according to the one or more user interests. A computer program product and computer system corresponding to the above method are also disclosed herein.
    Type: Grant
    Filed: June 12, 2017
    Date of Patent: May 21, 2019
    Assignee: International Business Machines Corporation
    Inventors: Shuo Li, Yue Li, Zhao Wei Li, Pei Pei Liang, Jun Liu, Yun Ting Wang, Xin Ying Yang, Guang Ming Zhang, Zhi Hui Zhu
  • Patent number: 10296623
    Abstract: A method for curating documents, executed by a computer, includes detecting one or more themes in a document, identifying one or more user interests for a user, presenting a ranked list of the one or more themes to the user, and dynamically updating the ranked list based on user feedback. The ranked list may be ranked according to the one or more user interests. A computer program product and computer system corresponding to the above method are also disclosed herein.
    Type: Grant
    Filed: November 3, 2015
    Date of Patent: May 21, 2019
    Assignee: International Business Machines Corporation
    Inventors: Shuo Li, Yue Li, Zhao Wei Li, Pei Pei Liang, Jun Liu, Yun Ting Wang, Xin Ying Yang, Guang Ming Zhang, Zhi Hui Zhu
  • Patent number: 10289718
    Abstract: In an approach to determining an access method for a partition in a partition table, a computer receives a query and determines if there is a partition table utilized by the query. When there is a partition table utilized by the query, then the computer determines that a partition in the partition table meets the plurality of conditions of the query. The computer collects a plurality of partition level statistics for the partition that meets the plurality of conditions of the query. Additionally, the computer determines, based, at least in part, on the plurality of partition level statistics, a cost for one or more access methods for the partition that meets the plurality of conditions of the query. Furthermore, the computer determines, based, at least in part, on the cost for each access method, an access method for the partition that meets the plurality of conditions of the query.
    Type: Grant
    Filed: March 28, 2018
    Date of Patent: May 14, 2019
    Assignee: International Business Machines Corporation
    Inventors: Shuo Li, Ping Liang, Ke Wei Wei, Xin Ying Yang
  • Patent number: 10282443
    Abstract: In an approach for query processing, a computer receives a query. The computer determines the received query does not correspond to a previously executed query. The computer parses the received query to identify input literals that include one or more of: data values, tables, fields, records, and a parameter included in the received query. The computer determines whether a pattern is associated with the input literals included in the received query. Responsive to determining a pattern is associated with the input literals, the computer determines a future parameter based on the pattern associated with the input literals, wherein the future parameter is a subsequent instance of a parameter of the received query that corresponds to the pattern. The computer creates a future query by incorporating the determined future parameter into the received query.
    Type: Grant
    Filed: March 2, 2016
    Date of Patent: May 7, 2019
    Assignee: International Business Machines Corporation
    Inventors: Ge Song, Kewei Wei, Xin Ying Yang
  • Patent number: 10282236
    Abstract: Embodiments of the present invention provide systems and methods for dynamically allocating data to multiple nodes. The method includes determining the usage of multiple buffers and the capability factors of multiple servers. Data is then allocated to multiple buffers associated with multiple active servers, based on the determined usage and capability factors, in order to keep the processing load on the multiple servers balanced.
    Type: Grant
    Filed: April 21, 2015
    Date of Patent: May 7, 2019
    Assignee: International Business Machines Corporation
    Inventors: Mi W. Shum, DongJie Wei, Samuel H. K. Wong, Xin Ying Yang, Xiang Zhou
  • Patent number: 10262022
    Abstract: A computer-implemented method includes identifying one or more database modification statements and identifying one or more operational unit indicators. The one or more operation unit indicators are caused to be generated by the one or more database modification statements. An anticipated operational size is determined. The anticipated operational size is an estimated total number of the one or more operational unit indicators. An anticipated operational throughput rate is determined. The anticipated operational throughput rate is a rate at which the operational unit indicators are expected to be generated. An anticipated total execution time of the one or more database modification statements is determined based on the anticipated operational size and the anticipated operational throughput rate. A corresponding computer program product and computer system are also disclosed.
    Type: Grant
    Filed: November 8, 2016
    Date of Patent: April 16, 2019
    Assignee: International Business Machines Corporation
    Inventors: Ting Xu Guan, Shuo Li, Ping Liang, Ke Wei Wei, Xin Ying Yang
  • Patent number: 10255313
    Abstract: A computer-implemented method includes identifying one or more database modification statements and identifying one or more operational unit indicators. The one or more operation unit indicators are caused to be generated by the one or more database modification statements. An anticipated operational size is determined. The anticipated operational size is an estimated total number of the one or more operational unit indicators. An anticipated operational throughput rate is determined. The anticipated operational throughput rate is a rate at which the operational unit indicators are expected to be generated. An anticipated total execution time of the one or more database modification statements is determined based on the anticipated operational size and the anticipated operational throughput rate. A corresponding computer program product and computer system are also disclosed.
    Type: Grant
    Filed: September 17, 2015
    Date of Patent: April 9, 2019
    Assignee: International Business Machines Corporation
    Inventors: Ting Xu Guan, Shuo Li, Ping Liang, Ke Wei Wei, Xin Ying Yang
  • Patent number: 10242058
    Abstract: In an approach for calculating one or more access paths during bind time, a computer receives a query. The computer identifies one or more access paths for processing the received query, wherein the one or more access paths include steps associated with retrieving data from a database based on the received query. The computer calculates resource costs associated with processing the received query on the one or more identified access paths based on one of more of: resources utilized to perform steps associated with processing the received query, and system statistics associated with the one or more identified access paths.
    Type: Grant
    Filed: July 14, 2015
    Date of Patent: March 26, 2019
    Assignee: International Business Machines Corporation
    Inventors: Hao Feng, Shuo Li, ShengYan Sun, Xin Ying Yang
  • Publication number: 20190087459
    Abstract: Aspects include a method that includes receiving a structured query language (SQL) database command at a processing device configured to manage a table space of a relational database, the database command including a merge statement. The method also includes identifying a group of target records from the database command, and associating each target record with one of a plurality of portions of the table space, and in response to determining that the group of target records is associated with more than one portion of the table space, sorting the target records into a plurality of sub-groups, each sub-group associated with a different portion of the table space. The method further includes generating a sub-task associated with each sub-group, the sub-task prescribing aspects of performing the merge operation using an associated sub-group respective sub-group, and performing all of the sub-tasks on the memory space in parallel.
    Type: Application
    Filed: November 20, 2018
    Publication date: March 21, 2019
    Inventors: Shuo Li, Ping Liang, Bing Qing Sun, Xiaobo Wang, Xin Ying Yang
  • Publication number: 20190087461
    Abstract: A technique relates to determining when to skip a group by clause in a query. A computer checks that a condition is satisfied for a table. The condition is selected from the group consisting of having a unique index on one or more columns of the table or having a function on the one or more columns that makes rows in the GROUP BY clause unique. The group by clause is part of the query on the table. In response to the condition being satisfied, the group by clause associated with the one or more columns is skipped. In response to the condition not being satisfied, the group by clause associated with the one or more columns is executed.
    Type: Application
    Filed: September 21, 2017
    Publication date: March 21, 2019
    Inventors: Ze Yuan Hu, Bing Qing Sun, Hang Xiao, Xin Ying Yang
  • Patent number: 10229146
    Abstract: Embodiments of the present invention provide a method, computer program product, and computer system for masking indexes. The method may include masking the index if the index contention exceeds a defined threshold. The method may also include configuring the mask type for the index to insert the index without masking. In response to determining that the mask type for the index is configured to insert the index without masking, the index is masked according to a set of rules.
    Type: Grant
    Filed: April 20, 2015
    Date of Patent: March 12, 2019
    Assignee: International Business Machines Corporation
    Inventors: Shuo Li, Ping Liang, Xin Ying Yang, Jian Wei Zhang
  • Patent number: 10229149
    Abstract: A computer maps a literal in a database query to a digital representation, wherein the database query comprises a predicate, the literal is a part of the predicate, and the digital representation is predetermined based at least in part on external statistical data. The computer estimates a filter factor for the predicate based at least in part on the digital representation and compressed statistical data, wherein the compressed statistical data are prepared at least in part from the external statistical data.
    Type: Grant
    Filed: May 17, 2017
    Date of Patent: March 12, 2019
    Assignee: International Business Machines Corporation
    Inventors: Ke Wei Wei, Maryela E. Weihrauch, Hao Wu, Xin Ying Yang, Miao Zheng