Patents by Inventor Kenneth Khiaw Hong Eng

Kenneth Khiaw Hong Eng 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: 20250068626
    Abstract: The present disclosure relates to manufacturing training data by leveraging an automated pipeline that manufactures visualization training datasets to train a machine learning model to convert a natural language utterance into meaning representation language logical form that includes one or more visualization actions. Aspects are directed towards accessing an original training dataset, a visualization query dataset, an incremental visualization dataset, a manipulation visualization dataset, or any combination thereof. One or more visualization training datasets are generated by: (i) modifying examples in the original training dataset, the visualization query dataset, or both to include visualization actions, (ii) generating examples, using the incremental visualization dataset, the manipulation visualization dataset, or both, that include visualization actions, or (iii) both (i) and (ii).
    Type: Application
    Filed: March 1, 2024
    Publication date: February 27, 2025
    Applicant: Oracle International Corporation
    Inventors: Gioacchino Tangari, Steve Wai-Chun Siu, Dalu Guo, Cong Duy Vu Hoang, Berk Sarioz, Chang Xu, Stephen Andrew McRitchie, Mark Edward Johnson, Christopher Mark Broadbent, Thanh Long Duong, Srinivasa Phani Kumar Gadde, Vishal Vishnoi, Chandan Basavaraju, Kenneth Khiaw Hong Eng
  • Publication number: 20250068627
    Abstract: Techniques are disclosed herein for transforming natural language conversations into a visual output. In one aspect, a computer-implement method includes generating an input string by concatenating a natural language utterance with a schema representation comprising a set of entities for visualization actions, generating, by a first encoder of a machine learning model, one or more embeddings of the input string, encoding, by a second encoder of the machine learning model, relations between elements in the schema representation and words in the natural language utterance based on the one or more embeddings, generating, by a grammar-based decoder of the machine learning model and based on the encoded relations and the one or more embeddings, an intermediate logical form that represents at least the query, the one or more visualization actions, or the combination thereof, and generating, based on the intermediate logical form, a command for a computing system.
    Type: Application
    Filed: March 26, 2024
    Publication date: February 27, 2025
    Applicant: Oracle International Corporation
    Inventors: Cong Duy Vu Hoang, Gioacchino Tangari, Stephen Andrew McRitchie, Nitika Mathur, Aashna Devang Kanuga, Steve Wai-Chun Siu, Dalu Guo, Chang Xu, Mark Edward Johnson, Christopher Mark Broadbent, Thanh Long Duong, Srinivasa Phani Kumar Gadde, Vishal Vishnoi, Chandan Basavaraju, Kenneth Khiaw Hong Eng
  • Patent number: 11475007
    Abstract: A query optimization system is described that, at runtime, optimizes the execution pipeline generated for a query. Based upon communications between nodes in the execution pipeline, the execution pipeline generated for a query is optimized by modifying the execution pipeline to create a modified execution pipeline. The modified execution pipeline is then executed to execute the query and results obtained for the query. The changes or modifications made to an execution pipeline may include changing the capabilities (e.g., changes to inputs and/or outputs of a node, changing the task(s) or function(s) performed by the node) of one or more nodes within the execution pipeline. The changes may include changing the position of one or more nodes within a directed acyclic graph representing the execution pipeline.
    Type: Grant
    Filed: March 8, 2021
    Date of Patent: October 18, 2022
    Assignee: ORACLE INTERNATIONAL CORPORATION
    Inventors: Ashish Mittal, Steve Simon Joseph Fernandez, Kenneth Khiaw Hong Eng
  • Patent number: 11307984
    Abstract: Optimized techniques are disclosed for sorting variable-length records using an optimized amount of memory while maintaining good locality of references. The amount of memory required for sorting the variable length records is optimized by reusing some of the memory used for storing the variable length records being sorted. Pairs of input runs storing variable length records may be merged into a merged run that contains the records in a sorted order by incrementally scanning, sorting, and copying the records from the two input runs being merged into memory pages of the merged run. When all the records of a memory page of an input run have been processed or copied to the merged run, that memory page can be emptied and released to a cache of empty memory pages. Memory pages available from the cache of empty memory pages can then be used for generating the merged run.
    Type: Grant
    Filed: September 28, 2020
    Date of Patent: April 19, 2022
    Assignee: Oracle International Corporation
    Inventors: Ashish Mittal, Steve Simon Joseph Fernandez, Kenneth Khiaw Hong Eng
  • Patent number: 11169999
    Abstract: Innovative techniques are disclosed for performing a combined sort and aggregation operation involving eagerly performing aggregation while sorting. The techniques described herein enable an aggregation and a group-by operation to be performed using an amount of system memory that is far less than the system memory required to store all the data records being processed while minimizing the need to spill data to disk. This combined sort and aggregation operation has better performance than conventional techniques since system memory is used more efficiently. In certain embodiments, a combined sort and aggregation operation is disclosed that enables the efficient sorting and aggregation of data records when the desired aggregation function is composable (such as SUM, COUNT, MIN and MAX aggregate operations).
    Type: Grant
    Filed: April 21, 2020
    Date of Patent: November 9, 2021
    Assignee: Oracle International Corporation
    Inventors: Ashish Mittal, Srinivas Vemuri, Kenneth Khiaw Hong Eng
  • Publication number: 20210191944
    Abstract: A query optimization system is described that, at runtime, optimizes the execution pipeline generated for a query. Based upon communications between nodes in the execution pipeline, the execution pipeline generated for a query is optimized by modifying the execution pipeline to create a modified execution pipeline. The modified execution pipeline is then executed to execute the query and results obtained for the query. The changes or modifications made to an execution pipeline may include changing the capabilities (e.g., changes to inputs and/or outputs of a node, changing the task(s) or function(s) performed by the node) of one or more nodes within the execution pipeline. The changes may include changing the position of one or more nodes within a directed acyclic graph representing the execution pipeline.
    Type: Application
    Filed: March 8, 2021
    Publication date: June 24, 2021
    Applicant: Oracle International Corporation
    Inventors: Ashish Mittal, Steve Simon Joseph Fernandez, Kenneth Khiaw Hong Eng
  • Patent number: 10970284
    Abstract: A query optimization system is described that, at runtime, optimizes the execution pipeline generated for a query. Based upon communications between nodes in the execution pipeline, the execution pipeline generated for a query is optimized by modifying the execution pipeline to create a modified execution pipeline. The modified execution pipeline is then executed to execute the query and results obtained for the query. The changes or modifications made to an execution pipeline may include changing the capabilities (e.g., changes to inputs and/or outputs of a node, changing the task(s) or function(s) performed by the node) of one or more nodes within the execution pipeline. The changes may include changing the position of one or more nodes within a directed acyclic graph representing the execution pipeline.
    Type: Grant
    Filed: May 11, 2018
    Date of Patent: April 6, 2021
    Assignee: Oracle International Corporation
    Inventors: Ashish Mittal, Steve Simon Joseph Fernandez, Kenneth Khiaw Hong Eng
  • Publication number: 20210011847
    Abstract: Optimized techniques are disclosed for sorting variable-length records using an optimized amount of memory while maintaining good locality of references. The amount of memory required for sorting the variable length records is optimized by reusing some of the memory used for storing the variable length records being sorted. Pairs of input runs storing variable length records may be merged into a merged run that contains the records in a sorted order by incrementally scanning, sorting, and copying the records from the two input runs being merged into memory pages of the merged run. When all the records of a memory page of an input run have been processed or copied to the merged run, that memory page can be emptied and released to a cache of empty memory pages. Memory pages available from the cache of empty memory pages can then be used for generating the merged run.
    Type: Application
    Filed: September 28, 2020
    Publication date: January 14, 2021
    Applicant: Oracle International Corporation
    Inventors: Ashish Mittal, Steve Simon Joseph Fernandez, Kenneth Khiaw Hong Eng
  • Patent number: 10824558
    Abstract: Optimized techniques are disclosed for sorting variable-length records using an optimized amount of memory while maintaining good locality of references. The amount of memory required for sorting the variable length records is optimized by reusing some of the memory used for storing the variable length records being sorted. Pairs of input runs storing variable length records may be merged into a merged run that contains the records in a sorted order by incrementally scanning, sorting, and copying the records from the two input runs being merged into memory pages of the merged run. When all the records of a memory page of an input run have been processed or copied to the merged run, that memory page can be emptied and released to a cache of empty memory pages. Memory pages available from the cache of empty memory pages can then be used for generating the merged run.
    Type: Grant
    Filed: April 23, 2018
    Date of Patent: November 3, 2020
    Assignee: Oracle International Corporation
    Inventors: Ashish Mittal, Steve Simon Joseph Fernandez, Kenneth Khiaw Hong Eng
  • Publication number: 20200250194
    Abstract: Innovative techniques are disclosed for performing a combined sort and aggregation operation involving eagerly performing aggregation while sorting. The techniques described herein enable an aggregation and a group-by operation to be performed using an amount of system memory that is far less than the system memory required to store all the data records being processed while minimizing the need to spill data to disk. This combined sort and aggregation operation has better performance than conventional techniques since system memory is used more efficiently. In certain embodiments, a combined sort and aggregation operation is disclosed that enables the efficient sorting and aggregation of data records when the desired aggregation function is composable (such as SUM, COUNT, MIN and MAX aggregate operations).
    Type: Application
    Filed: April 21, 2020
    Publication date: August 6, 2020
    Applicant: Oracle International Corporation
    Inventors: Ashish Mittal, Srinivas Vemuri, Kenneth Khiaw Hong Eng
  • Patent number: 10732853
    Abstract: Techniques for dynamically changing the amount of memory that is allocated to and used by processes (e.g., sorter processes) executed concurrently by a data processing system in a manner that is adaptive to the overall memory usage of the system. The ability to dynamically change the amount of memory that can be allocated to and used by individual processes increases and optimizes the overall memory utilization of the data processing system, which in turn results in the operations (e.g., sorting) performed by the processes to be performed in a more efficient manner. A memory manager is provided that is responsible for periodically collecting memory related information for the data processing system and for the processes (e.g., sorter processes) executed by the data processing system, and based on the collected information, for periodically and dynamically causing the memory used by the processes to be changed during the lifetime of the processes.
    Type: Grant
    Filed: April 4, 2018
    Date of Patent: August 4, 2020
    Assignee: Oracle International Corporation
    Inventors: Ashish Mittal, Kenneth Khiaw Hong Eng
  • Patent number: 10691695
    Abstract: Innovative techniques are disclosed for performing a combined sort and aggregation operation involving eagerly performing aggregation while sorting. The techniques described herein enable an aggregation and a group-by operation to be performed using an amount of system memory that is far less than the system memory required to store all the data records being processed while minimizing the need to spill data to disk. This combined sort and aggregation operation has better performance than conventional techniques since system memory is used more efficiently. In certain embodiments, a combined sort and aggregation operation is disclosed that enables the efficient sorting and aggregation of data records when the desired aggregation function is composable (such as SUM, COUNT, MIN and MAX aggregate operations).
    Type: Grant
    Filed: April 11, 2018
    Date of Patent: June 23, 2020
    Assignee: Oracle International Corporation
    Inventors: Ashish Mittal, Srinivas Vemuri, Kenneth Khiaw Hong Eng
  • Publication number: 20180329956
    Abstract: A query optimization system is described that, at runtime, optimizes the execution pipeline generated for a query. Based upon communications between nodes in the execution pipeline, the execution pipeline generated for a query is optimized by modifying the execution pipeline to create a modified execution pipeline. The modified execution pipeline is then executed to execute the query and results obtained for the query. The changes or modifications made to an execution pipeline may include changing the capabilities (e.g., changes to inputs and/or outputs of a node, changing the task(s) or function(s) performed by the node) of one or more nodes within the execution pipeline. The changes may include changing the position of one or more nodes within a directed acyclic graph representing the execution pipeline.
    Type: Application
    Filed: May 11, 2018
    Publication date: November 15, 2018
    Applicant: Oracle International Corporation
    Inventors: Ashish Mittal, Steve Simon Joseph Fernandez, Kenneth Khiaw Hong Eng
  • Publication number: 20180314465
    Abstract: Optimized techniques are disclosed for sorting variable-length records using an optimized amount of memory while maintaining good locality of references. The amount of memory required for sorting the variable length records is optimized by reusing some of the memory used for storing the variable length records being sorted. Pairs of input runs storing variable length records may be merged into a merged run that contains the records in a sorted order by incrementally scanning, sorting, and copying the records from the two input runs being merged into memory pages of the merged run. When all the records of a memory page of an input run have been processed or copied to the merged run, that memory page can be emptied and released to a cache of empty memory pages. Memory pages available from the cache of empty memory pages can then be used for generating the merged run.
    Type: Application
    Filed: April 23, 2018
    Publication date: November 1, 2018
    Applicant: Oracle International Corporation
    Inventors: Ashish Mittal, Steve Simon Joseph Fernandez, Kenneth Khiaw Hong Eng
  • Publication number: 20180300067
    Abstract: Techniques for dynamically changing the amount of memory that is allocated to and used by processes (e.g., sorter processes) executed concurrently by a data processing system in a manner that is adaptive to the overall memory usage of the system. The ability to dynamically change the amount of memory that can be allocated to and used by individual processes increases and optimizes the overall memory utilization of the data processing system, which in turn results in the operations (e.g., sorting) performed by the processes to be performed in a more efficient manner. A memory manager is provided that is responsible for periodically collecting memory related information for the data processing system and for the processes (e.g., sorter processes) executed by the data processing system, and based on the collected information, for periodically and dynamically causing the memory used by the processes to be changed during the lifetime of the processes.
    Type: Application
    Filed: April 4, 2018
    Publication date: October 18, 2018
    Applicant: Oracle International Corporation
    Inventors: Ashish Mittal, Kenneth Khiaw Hong Eng
  • Publication number: 20180300373
    Abstract: Innovative techniques are disclosed for performing a combined sort and aggregation operation involving eagerly performing aggregation while sorting. The techniques described herein enable an aggregation and a group-by operation to be performed using an amount of system memory that is far less than the system memory required to store all the data records being processed while minimizing the need to spill data to disk. This combined sort and aggregation operation has better performance than conventional techniques since system memory is used more efficiently. In certain embodiments, a combined sort and aggregation operation is disclosed that enables the efficient sorting and aggregation of data records when the desired aggregation function is composable (such as SUM, COUNT, MIN and MAX aggregate operations).
    Type: Application
    Filed: April 11, 2018
    Publication date: October 18, 2018
    Applicant: Oracle International Corporation
    Inventors: Ashish Mittal, Srinivas Vemuri, Kenneth Khiaw Hong Eng
  • Patent number: 8543535
    Abstract: An aspect of the present invention simplifies generating a star schema from a snowflake schema. In an embodiment, a user first specifies fact tables to be included in a star schema, and a synchronization tool inspects the snowflake schema to determine the dimension tables linked to the specified fact tables. The determined dimension tables are included in the star schema sought to be generated.
    Type: Grant
    Filed: February 24, 2010
    Date of Patent: September 24, 2013
    Assignee: Oracle International Corporation
    Inventors: Samir Satpathy, Alextair Dominico Mascarenhas, Harvard Jun-Hua Pan, Kenneth Khiaw Hong Eng, Ladislav Kovac
  • Publication number: 20110208692
    Abstract: An aspect of the present invention simplifies generating a star schema from a snowflake schema. In an embodiment, a user first specifies fact tables to be included in a star schema, and a synchronization tool inspects the snowflake schema to determine the dimension tables linked to the specified fact tables. The determined dimension tables are included in the star schema sought to be generated.
    Type: Application
    Filed: February 24, 2010
    Publication date: August 25, 2011
    Applicant: Oracle International Corporation
    Inventors: Samir Satpathy, Alextair Dominico Mascarenhas, Harvard Jun-Hua Pan, Kenneth Khiaw Hong Eng, Ladislav Kovac