Patents by Inventor Grace Kwan-On Au

Grace Kwan-On Au 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: 11113283
    Abstract: A query having a Union All view is identified. A logical join between Union AH view/derived table and other tables is broken down into multiple physical joins. The physical joins are pushed to the branches. Cost-based processing statistics are obtained for the branches. An optimal plan for the joins is selected based on the statistics; representing an optimal query execution for the query. The optimal query execution plan is provided to a database engine for executing the optimal query execution plan against a data warehouse.
    Type: Grant
    Filed: December 18, 2017
    Date of Patent: September 7, 2021
    Assignee: Teradata US, Inc.
    Inventors: Mohammed Al-Kateb, Grace Kwan-On Au, Rama Krishna Korlapati, Lu Ma, Sanjay Nair
  • Patent number: 11086870
    Abstract: A data store system includes an array of persistent storage devices configured to store a plurality of data store tables. The data store system includes a processor in communication with the storage device. The processor may receive a query comprising an aggregate function and identify structure of an argument of the aggregate function. The subset of data store tables may be associated with the argument. The processor may partially-execute the aggregate function on each data store table in the subset involved in the argument of the aggregate function to create partially-executed results for each data store table of the subset of data store tables. The processor may join the partially-executed results based on join conditions contained in the aggregate function. The processor may complete execution of the aggregate function on the partially-executed results to generate a final result of the aggregate function. A method and computer-readable medium are also disclosed.
    Type: Grant
    Filed: December 30, 2015
    Date of Patent: August 10, 2021
    Assignee: Teradata US, Inc.
    Inventors: Anantha B. Subramanian, Sanjay Nair, Yi Xia, Grace Kwan-On Au, Kuorong Chiang
  • Patent number: 10997168
    Abstract: One or a soft correlation of a database can be adjusted (e.g., modified, replaced, overwritten) for use with respect to one or more record(s) of the database associated with the soft correlation, by considering at least one or more violations of the soft correlations in the one or more of records database records associated with the soft correlation. In addition, an adjusted soft correlation can be stored and used for optimizations of database queries pertaining to one or more records associated with the adjusted soft correlation. Typically, the adjusted soft correlation is adjusted by at least considering the violations of an original soft correlation in the one or more records relating to the database queries.
    Type: Grant
    Filed: December 13, 2018
    Date of Patent: May 4, 2021
    Assignee: Teradata US, Inc.
    Inventors: Mohamed Yassin Eltabakh, Grace Kwan-On Au, Sanjay Nair, Mohammed Al-Kateb, Paul Laurence Sinclair
  • Patent number: 10942923
    Abstract: A database query to be run against a database is received by a processor. The query includes a query predicate. The query predicate includes a condition. The condition applies to a single database table. The condition is parsed to create an input vector. The input vector is submitted to a neural network. The neural network is trained to calculate the selectivity, a number of unique values (NUV) of results of applying predicates to the single database table, and a high mode frequency (HMF) of results of applying predicates to the single database table. The neural network determines the selectivity of the query predicate, an NUV for each column in the result of applying the query predicate to the single database table, and an HMF for each column in the result of applying the query predicate to the single database table.
    Type: Grant
    Filed: December 14, 2018
    Date of Patent: March 9, 2021
    Assignee: Teradata US, Inc.
    Inventors: Yinuo Zhang, Sung Jin Kim, Grace Kwan-On Au
  • Publication number: 20210056106
    Abstract: An apparatus, method and computer program product for query optimization in a Relational Database Management System (RDBMS), wherein an optimizer accesses a query expression repository (QER), so that the optimizer learns from previous versions of the queries to improve current and subsequent versions of the queries. The QER stores planning and execution information for QEs from the previous versions of the queries, wherein the QEs comprise table relations, intermediate results and/or final results of operations in the previous versions of the queries. The optimizer searches the QER for QEs from the query execution plans, and uses information from the QEs stored in the QER when optimizing the current and subsequent versions of the queries. The optimizer may also reuses results from the QEs stored in the QER.
    Type: Application
    Filed: December 27, 2019
    Publication date: February 25, 2021
    Applicant: Teradata US, Inc.
    Inventors: Grace Kwan-On Au, Nobul Reddy Goli, Vivek Kumar, Ming Zhang, Bin Cao, Sanjay Nair, Kanaka Durga Rajanala, Sanjib Mishra, Naveen Jaiswal, Lu Ma, Xiaorong Luo
  • Publication number: 20200192893
    Abstract: One or a soft correlation of a database can be adjusted (e.g., modified, replaced, overwritten) for use with respect to one or more record(s) of the database associated with the soft correlation, by considering at least one or more violations of the soft correlations in the one or more of records database records associated with the soft correlation. In addition, an adjusted soft correlation can be stored and used for optimizations of database queries pertaining to one or more records associated with the adjusted soft correlation. Typically, the adjusted soft correlation is adjusted by at least considering the violations of an original soft correlation in the one or more records relating to the database queries.
    Type: Application
    Filed: December 13, 2018
    Publication date: June 18, 2020
    Inventors: Mohamed Yassin Eltabakh, Grace Kwan-On Au, Sanjay Nair, Mohammed Al-Kateb, Paul Laurence Sinclair
  • Publication number: 20200175016
    Abstract: Multiple cost models (e.g., a sub-operations costing model and logical-operations costing model) can be used to make cost estimations of execution of database queries in one and each one of the multiple heterogeneous database systems. As a result, a “hybrid” cost estimating mode can be used whereby two or more cost models can be used in a single database system in to order maximize the advantages and minimize the disadvantages of each of the cost models, thereby striving to achieve an optimal balance. In addition, cost estimation can be switched between a hybrid cost estimating mode and a single cost estimating mode. The switch can, for example, be made as a part of tuning phase, as more information about actual costs of execution of database queries becomes more available, or as a result of changes to the database system and/or it operations, and so on. As a result, a flexible cost estimating mechanism can also be provided.
    Type: Application
    Filed: December 19, 2018
    Publication date: June 4, 2020
    Applicant: Teradata US, Inc.
    Inventors: Sanjay Nair, Sreyas Srimath Tirumala, Nurjahan Begum, Chandana Prakash, Mohammed Al-Kateb, Conrad Kwok-Wai Tang, Mohamed Yassin Eltabakh, Kassem Awada, Grace Kwan-On Au
  • Patent number: 10545923
    Abstract: A database operation is performed in a file system residing on a plurality of processing modules. The file system includes a first relation having a plurality of first-relation entries. Each of the plurality of first-relation entries has a first-relation attribute that is of interest in the database operation. A value of a distribution attribute in each of the first-relation entries is set to a unique value selected from among a domain of unique values. The first-relation entries of the first relation are redistributed among the plurality of processing modules based on the first-relation attribute and the distribution attribute. The computational operation is performed to produce a result.
    Type: Grant
    Filed: December 19, 2017
    Date of Patent: January 28, 2020
    Assignee: Teradata US, Inc.
    Inventors: Richard Leon Kimball, III, Paul Laurence Sinclair, Grace Kwan-On Au
  • Publication number: 20190188299
    Abstract: A query having a Union All view is identified. A logical join between Union AH view/derived table and other tables is broken down into multiple physical joins. The physical joins are pushed to the branches. Cost-based processing statistics are obtained for the branches. An optimal plan for the joins is selected based on the statistics; representing an optimal query execution for the query. The optimal query execution plan is provided to a database engine for executing the optimal query execution plan against a data warehouse.
    Type: Application
    Filed: December 18, 2017
    Publication date: June 20, 2019
    Inventors: Mohammed Al-Kateb, Grace Kwan-On Au, Rama Krishna Korlapati, Lu Ma, Sanjay Nair
  • Patent number: 10268724
    Abstract: Techniques for improving complex database queries are provided. A determination is made whether to adopt a static or dynamic query execution plan based on metrics. When the dynamic query execution plan is used, a request fragment of the request is planned and the corresponding plan fragment is executed. The processed fragment provides feedback related to its processing to the remaining request and the process is repeated on the remaining request until the request is completed.
    Type: Grant
    Filed: September 30, 2013
    Date of Patent: April 23, 2019
    Assignee: Teradata US, Inc.
    Inventors: Rama Krishna Korlapati, Paul Sinclair, Grace Kwan-On Au, Vijay Sarathy
  • Patent number: 10180961
    Abstract: A query optimizer identifies a condition that supports a remote nested join. A first Access Module Processor (AMP) is sent the condition to obtain a first set of rows that satisfy the condition from a first table and the first AMP is instructed to perform the remote nested join with a second remote AMP to acquire a second set of rows that satisfy the condition from a second table. The first AMP joins the first set of rows and the second set of rows as a join result, which is returned to the query optimizer.
    Type: Grant
    Filed: December 17, 2014
    Date of Patent: January 15, 2019
    Assignee: Teradata US, Inc.
    Inventors: Grace Kwan-On Au, Mohammed Al-Kateb
  • Publication number: 20160179886
    Abstract: A query optimizer identifies a condition that supports a remote nested join. A first Access Module Processor (AMP) is sent the condition to obtain a first set of rows that satisfy the condition from a first table and the first AMP is instructed to perform the remote nested join with a second remote AMP to acquire a second set of rows that satisfy the condition from a second table. The first AMP joins the first set of rows and the second set of rows as a join result, which is returned to the query optimizer.
    Type: Application
    Filed: December 17, 2014
    Publication date: June 23, 2016
    Inventors: Grace Kwan-On Au, Mohammed Al-Kateb
  • Patent number: 8990186
    Abstract: Techniques for updating join indexes are provided. A determination is made to update date criteria in a join index query statement. The join index is parsed for current date and current time criteria. The join index is revised based on the location of the current date and current time criteria as they appear in the original join index. The revisions include new criteria that minimize the effort in maintaining and using the join index.
    Type: Grant
    Filed: December 28, 2011
    Date of Patent: March 24, 2015
    Assignee: Teradata US, Inc.
    Inventors: Xiaobin Ma, Grace Kwan-On Au, Lu Ma
  • Patent number: 8972381
    Abstract: Techniques for processing joins on column partitioned tables are provided. A query includes a first-Column Partition (CP) table joined with a second-CP table. The query is decomposed into a three-step process and rewritten and processed.
    Type: Grant
    Filed: December 26, 2012
    Date of Patent: March 3, 2015
    Assignee: Teradata US, Inc.
    Inventors: Mohammed Al-Kateb, Grace Kwan-On Au, Sanjay Sukumaran
  • Patent number: 8949218
    Abstract: Techniques for processing joins on column partitioned tables are provided. A join operation having a column partitioned table within a query is decomposed into a two-step process. The first process performs the join condition on the column portioned table with optional filtering conditions and a non-column partitioned table and spools the resulting columns to a spooled table. The spooled table is then rowid joined back to the column partitioned table to acquire remaining columns not present in the spooled table. Both the first and second steps can be separately resolved for costs when determining a query execution plan.
    Type: Grant
    Filed: December 26, 2012
    Date of Patent: February 3, 2015
    Assignee: Teradata US, Inc.
    Inventors: Grace Kwan-On Au, Mohammed Al-Kateb
  • Publication number: 20140280036
    Abstract: Techniques for improving complex database queries are provided. A determination is made whether to adopt a static or dynamic query execution plan based on metrics. When the dynamic query execution plan is used, a request fragment of the request is planned and the corresponding plan fragment is executed. The processed fragment provides feedback related to its processing to the remaining request and the process is repeated on the remaining request until the request is completed.
    Type: Application
    Filed: September 30, 2013
    Publication date: September 18, 2014
    Applicant: Teradata US, Inc.
    Inventors: Rama Krishna Korlapati, Paul Sinclair, Grace Kwan-On Au, Vijay Sarathy
  • Publication number: 20140188924
    Abstract: Techniques for ordering predicates in column partitioned databases for query optimization. Predicates on a single CP table within a query are organized to predicate-CP nodes with various sets of column partitions. The predicates within each predicate-CP node and the predicate-CP nodes as a whole are ordered in ascending order of cost which is determined by CPU/IO cost and predicate selectivity. The reorganized query is then executed.
    Type: Application
    Filed: December 27, 2012
    Publication date: July 3, 2014
    Applicant: Teradata US, Inc.
    Inventors: Lu Ma, Grace Kwan-On Au
  • Publication number: 20140181077
    Abstract: Techniques for processing joins on column partitioned tables are provided. A query includes a first-Column Partition (CP) table joined with a second-CP table. The query is decomposed into a three-step process and rewritten and processed.
    Type: Application
    Filed: December 26, 2012
    Publication date: June 26, 2014
    Applicant: Teradata US, Inc.
    Inventors: Mohammed Al-Kateb, Grace Kwan-On Au, Sanjay Sukumaran
  • Publication number: 20140181076
    Abstract: Techniques for processing joins on column partitioned tables are provided. A join operation having a column partitioned table within a query is decomposed into a two-step process. The first process performs the join condition on the column portioned table with optional filtering conditions and a non-column partitioned table and spools the resulting columns to a spooled table. The spooled table is then rowid joined back to the column partitioned table to acquire remaining columns not present in the spooled table. Both the first and second steps can be separately resolved for costs when determining a query execution plan.
    Type: Application
    Filed: December 26, 2012
    Publication date: June 26, 2014
    Applicant: Teradata US, Inc.
    Inventors: Grace Kwan-On Au, Mohammed Al-Kateb
  • Publication number: 20130173588
    Abstract: Techniques for updating join indexes are provided. A determination is made to update date criteria in a join index query statement. The join index is parsed for current date and current time criteria. The join index is revised based on the location of the current date and current time criteria as they appear in the original join index. The revisions include new criteria that minimize the effort in maintaining and using the join index.
    Type: Application
    Filed: December 28, 2011
    Publication date: July 4, 2013
    Applicant: Teradata US, Inc.
    Inventors: Xiaobin Ma, Grace Kwan-On Au, Lu Ma