Patents by Inventor Mohammed Al-Kateb

Mohammed Al-Kateb 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: 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
  • Publication number: 20210034624
    Abstract: In some examples, a system learns properties of an analytical function based on information of queries invoking the analytical function that have been previously executed, creates a function descriptor for the analytical function based on the learning, and provides the function descriptor for use by an optimizer in generating an execution plan for a received database query that includes the analytical function.
    Type: Application
    Filed: December 23, 2019
    Publication date: February 4, 2021
    Inventors: Mohamed Ahmed Yassin Eltabakh, Mohammed Al-Kateb, Awny Kayed Al-Omari, Sanjay Nair
  • 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: 20200183935
    Abstract: Execution of a query invoking an analytical function (AF) is optimized. The query includes a join operation between an AF table and an AuxiliaryTable and includes determining that the AF includes a plurality of AF properties. Query-level properties about the query are inferred. It is determined to change an order of the join operation from the plurality of AF properties and query-level properties.
    Type: Application
    Filed: December 5, 2019
    Publication date: June 11, 2020
    Applicant: Teradata US, Inc
    Inventors: Christina Pavlopoulou, Mahbub Hasan, B. Anantha Subramanian, Mohammed Al-Kateb, Awny Kayed Al-Omari, Kashif Abdullah Siddiqui, Robert Matthew Wehrmeister, Mohamed Yassin Eltabakh
  • 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
  • Publication number: 20200151575
    Abstract: An apparatus, method and computer program product for neural network training over very large distributed datasets, wherein a relational database management system (RDBMS) is executed in a computer system comprised of a plurality of compute units, and the RDBMS manages a relational database comprised of one or more tables storing data. One or more local neural network models are trained in the compute units using the data stored locally on the compute units. At least one global neural network model is generated in the compute units by aggregating the local neural network models after the local neural network models are trained.
    Type: Application
    Filed: November 12, 2019
    Publication date: May 14, 2020
    Applicant: Teradata US, Inc.
    Inventors: Wellington Marcos Cabrera Arevalo, Anandh Ravi Kumar, Mohammed Al-Kateb, Sanjay Nair, Sandeep Singh Sandha
  • 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
  • Publication number: 20190114295
    Abstract: Techniques for improving complex database queries are provided. A determination is made whether to adopt a static or dynamic query execution plan for a received database query based on metrics. When a dynamic query execution plan is adopted, the database query is separated into query fragments. A plan fragment is generated for each query fragment and executed to generate feedback for the plan fragment. The feedback from the execution of each plan fragment is used to initiate query rewrite rules to simplify the corresponding query fragments. The rewritten query fragments are combined to generate the dynamic query plan.
    Type: Application
    Filed: December 12, 2018
    Publication date: April 18, 2019
    Applicant: Teradata US, Inc.
    Inventors: Bin Cao, Yi Xia, Sanjib Mishra, Rama Krishna Korlapati, Tri Minh Tran, Mohammed Al-Kateb, Paul Laurence Sinclair, Chengyang Zhang
  • 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: 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: 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
  • Patent number: 8392381
    Abstract: Algorithms and concepts for maintaining uniform random samples of streaming data and stream joins. These algorithms and concepts are used in systems and methods, such as wireless sensor networks and methods for implementing such networks, that generate and handle such streaming data and/or stream joins. The algorithms and concepts directed to streaming data allow one or more sample reservoirs to change size during sampling. When multiple reservoirs are maintained, some of the algorithms and concepts periodically reallocate memory among the multiple reservoirs to effectively utilize limited memory. The algorithms and concepts directed to stream joins allow reservoir sampling to proceed as a function of the probability of a join sampling operation. In memory limited situations wherein memory contains the sample reservoir and a join buffer, some of the stream join algorithms and concepts progressively increase the size of the sampling reservoir and reallocate memory from the join buffer to the reservoir.
    Type: Grant
    Filed: May 8, 2008
    Date of Patent: March 5, 2013
    Assignee: The University of Vermont and State Agricultural College
    Inventors: Mohammed Al-Kateb, Byung Suk Lee, Xiaoyang Wang
  • Publication number: 20110313977
    Abstract: Algorithms and concepts for maintaining uniform random samples of streaming data and stream joins. These algorithms and concepts are used in systems and methods, such as wireless sensor networks and methods for implementing such networks, that generate and handle such streaming data and/or stream joins. The algorithms and concepts directed to streaming data allow one or more sample reservoirs to change size during sampling. When multiple reservoirs are maintained, some of the algorithms and concepts periodically reallocate memory among the multiple reservoirs to effectively utilize limited memory. The algorithms and concepts directed to stream joins allow reservoir sampling to proceed as a function of the probability of a join sampling operation. In memory limited situations wherein memory contains the sample reservoir and a join buffer, some of the stream join algorithms and concepts progressively increase the size of the sampling reservoir and reallocate memory from the join buffer to the reservoir.
    Type: Application
    Filed: May 8, 2008
    Publication date: December 22, 2011
    Applicant: The University of Vermont and State Agricultural College
    Inventors: Mohammed Al-Kateb, Byung Suk Lee, Xiaoyang Wang