Patents by Inventor In-Jerng Choe

In-Jerng Choe 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: 20220237162
    Abstract: Methods for cardinality estimation feedback loops in query processing are performed by systems and devices. A query host executes queries against data sources via an engine based on estimated cardinalities, and query monitors generate event signals during and at completion of execution. Event signals include indicia of actual data cardinality, runtime statistics, and query parameters in query plans, and are routed to analyzers of a feedback optimizer where event signal information is analyzed. The feedback optimizer utilizes analysis results to generate change recommendations as feedback for later executions of the queries, or similar queries, performed by a query optimizer of the query host. The query host stores change recommendations, and subsequent queries are monitored for the same or similar queries to which change recommendations are applied to query plans for execution and observance by the query monitors. Change recommendations are optionally viewed and selected via a user interface.
    Type: Application
    Filed: April 19, 2022
    Publication date: July 28, 2022
    Inventors: Pedro M. Lopes, Vasileios Papadimos, Joel L. Redman, JR., Gjorgji Gjeorgjievski, Joseph I. Sack, In-Jerng Choe, Ankit Mahajan, Nan Xing, Alexey Eksarevskiy, Chandrashekhar Kadiam
  • Patent number: 11334538
    Abstract: Methods for cardinality estimation feedback loops in query processing are performed by systems and devices. A query host executes queries against data sources via an engine based on estimated cardinalities, and query monitors generate event signals during and at completion of execution. Event signals include indicia of actual data cardinality, runtime statistics, and query parameters in query plans, and are routed to analyzers of a feedback optimizer where event signal information is analyzed. The feedback optimizer utilizes analysis results to generate change recommendations as feedback for later executions of the queries, or similar queries, performed by a query optimizer of the query host. The query host stores change recommendations, and subsequent queries are monitored for the same or similar queries to which change recommendations are applied to query plans for execution and observance by the query monitors. Change recommendations are optionally viewed and selected via a user interface.
    Type: Grant
    Filed: May 31, 2019
    Date of Patent: May 17, 2022
    Assignee: MICROSOFT TECHNOLOGY LICENSING, LLC
    Inventors: Pedro M. Lopes, Vasileios Papadimos, Joel L. Redman, Jr., Gjorgji Gjeorgjievski, Joseph I. Sack, In-Jerng Choe, Ankit Mahajan, Nan Xing, Alexey Eksarevskiy, Chandrashekhar Kadiam
  • Publication number: 20200379963
    Abstract: Methods for cardinality estimation feedback loops in query processing are performed by systems and devices. A query host executes queries against data sources via an engine based on estimated cardinalities, and query monitors generate event signals during and at completion of execution. Event signals include indicia of actual data cardinality, runtime statistics, and query parameters in query plans, and are routed to analyzers of a feedback optimizer where event signal information is analyzed. The feedback optimizer utilizes analysis results to generate change recommendations as feedback for later executions of the queries, or similar queries, performed by a query optimizer of the query host. The query host stores change recommendations, and subsequent queries are monitored for the same or similar queries to which change recommendations are applied to query plans for execution and observance by the query monitors. Change recommendations are optionally viewed and selected via a user interface.
    Type: Application
    Filed: May 31, 2019
    Publication date: December 3, 2020
    Inventors: Pedro M. Lopes, Vasileios Papadimos, Joel L. Redman, JR., Gjorgji Gjeorgjievski, Joseph I. Sack, In-Jerng Choe, Ankit Mahajan, Nan Xing, Alexey Eksarevskiy, Chandrashekhar Kadiam
  • Publication number: 20140379725
    Abstract: The degree of parallel processing used to build a database index can be dynamically adjusted based on actual memory usage of individual parallel processing units. Memory can be reserved to prevent an out-of-memory condition. A predetermined number of initial parallel processing units can be activated. The actual usage of resources by the initial activated parallel processing unit(s) can be measured to establish an initial baseline for resource consumption per parallel processing unit. The baseline for resource consumption per parallel processing unit can be used to determine how many additional parallel processing units are activated. The actual resource usage of each parallel processing unit can be measured and used to refine the baseline memory usage. The refined average memory usage can be used to determine how many additional parallel processing units are activated.
    Type: Application
    Filed: December 23, 2013
    Publication date: December 25, 2014
    Applicant: Microsoft Corporation
    Inventors: In-Jerng Choe, Mayukh Saubhasik, Ashit Gosalia, Srikumar Rangarajan
  • Patent number: 8065682
    Abstract: A database can have multiple requests applied at one time. Each of these requests requires a specific amount of server resources. There can be a differentiation of user-submitted workloads between each other. These workloads are a set of queries submitted by different users. Each query can have specific resource limits. In addition, each set can have specific resource limits.
    Type: Grant
    Filed: February 27, 2007
    Date of Patent: November 22, 2011
    Assignee: Microsoft Corporation
    Inventors: Boris Baryshnikov, Aleksandras Surna, In-Jerng Choe, Alexandre Verbitski, Ravishankar Rajamani
  • Publication number: 20080209428
    Abstract: A database can have multiple requests applied at one time. Each of these requests requires a specific amount of server resources. There can be a differentiation of user-submitted workloads between each other. These workloads are a set of queries submitted by different users. Each query can have specific resource limits. In addition, each set can have specific resource limits.
    Type: Application
    Filed: February 27, 2007
    Publication date: August 28, 2008
    Applicant: MICROSOFT CORPORATION
    Inventors: Boris Baryshnikov, Aleksandras Surna, In-Jerng Choe, Alexandre Verbitski, Ravishankar Rajamani