Patents by Inventor Andrew P. Passe
Andrew P. Passe 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: 9563538Abstract: Methods, systems, and products are provided for code path tracking. Embodiments include identifying an instrumented trace point in software code to be path tracked; identifying a function executed at the instrumented trace point in the software code; identifying parameters for the function executed at the instrumented trace point; and recording a description of the function, the parameters, and the result of the execution of the function using the parameters.Type: GrantFiled: April 10, 2012Date of Patent: February 7, 2017Assignee: International Business Machines CorporationInventors: Robert J. Bestgen, Robert D. Driesch, Jr., Wei Hu, Shantan Kethireddy, Edward J. Miller, Andrew P. Passe, Ulrich Thiemann
-
Patent number: 9430525Abstract: A system and method of creating an access plan for a database query is disclosed. The system and method include identifying a first portion of a column of a table of a database. The first portion of the column may be in a select statement of the database query. The system and method include estimating a first statistical value for the column. The estimating may occur by analyzing a second portion of the column. The system and method include generating the access plan to predict a characteristic of a set of results for the database query. In generating the access plan, the first statistical value for the column may be used.Type: GrantFiled: May 28, 2014Date of Patent: August 30, 2016Assignee: International Business Machines CorporationInventors: Adam D. Braham, Andrew P. Passe
-
Patent number: 9355147Abstract: A system and method of creating an access plan for a database query is disclosed. The system and method include identifying a first portion of a column of a table of a database. The first portion of the column may be in a select statement of the database query. The system and method include estimating a first statistical value for the column. The estimating may occur by analyzing a second portion of the column. The system and method include generating the access plan to predict a characteristic of a set of results for the database query. In generating the access plan, the first statistical value for the column may be used.Type: GrantFiled: February 13, 2014Date of Patent: May 31, 2016Assignee: International Business Machines CorporationInventors: Adam D. Braham, Andrew P. Passe
-
Patent number: 9189047Abstract: Embodiments of the invention provide techniques for optimizing database queries for energy efficiency. In general, a query optimizer is configured to compare energy requirements of query plans, and to select a query plan requiring minimal energy to execute. In one embodiment, the query optimizer may also compare time performance of the query plans, and may select a query plan by matching to a user preference for a relative priority between energy requirements and time performance.Type: GrantFiled: May 8, 2008Date of Patent: November 17, 2015Assignee: International Business Machines CorporationInventors: Robert J. Bestgen, Wei Hu, Shantan Kethireddy, Andrew P. Passe, Ulrich Thiemann
-
Publication number: 20150227585Abstract: A system and method of creating an access plan for a database query is disclosed. The system and method include identifying a first portion of a column of a table of a database. The first portion of the column may be in a select statement of the database query. The system and method include estimating a first statistical value for the column. The estimating may occur by analyzing a second portion of the column. The system and method include generating the access plan to predict a characteristic of a set of results for the database query. In generating the access plan, the first statistical value for the column may be used.Type: ApplicationFiled: May 28, 2014Publication date: August 13, 2015Applicant: International Business Machines CorporationInventors: Adam D. Braham, Andrew P. Passe
-
Publication number: 20150227584Abstract: A system and method of creating an access plan for a database query is disclosed. The system and method include identifying a first portion of a column of a table of a database. The first portion of the column may be in a select statement of the database query. The system and method include estimating a first statistical value for the column. The estimating may occur by analyzing a second portion of the column. The system and method include generating the access plan to predict a characteristic of a set of results for the database query. In generating the access plan, the first statistical value for the column may be used.Type: ApplicationFiled: February 13, 2014Publication date: August 13, 2015Applicant: International Business Machines CorporationInventors: Adam D. Braham, Andrew P. Passe
-
Patent number: 9002825Abstract: In an embodiment, a recursive query is received that comprises a first select statement with a seed select statement and a second select statement with a recursive reference, wherein the recursive query further identifies at least two columns in at least one table, wherein the at least two columns have parent-child relationships represented by nodes in a graph, wherein the graph represents the organization of values in rows in the at least one table. A target recursion depth is calculated for the graph based on a fanout of the graph. In an embodiment, the target recursion depth is calculated by summing the fanout at each recursion depth of the graph multiplied by a number of nodes at each recursion depth of the graph. An estimated number of rows that the recursive query will return is estimated based on the target recursion depth.Type: GrantFiled: March 12, 2013Date of Patent: April 7, 2015Assignee: International Business Machines CorporationInventors: Lynnette E. Carston, Brian R. Muras, Andrew P. Passe
-
Patent number: 8700605Abstract: In an embodiment, a recursive query is received that comprises a first select statement with a seed select statement and a second select statement with a recursive reference, wherein the recursive query further identifies at least two columns in at least one table, wherein the at least two columns have parent-child relationships represented by nodes in a graph, wherein the graph represents the organization of values in rows in the at least one table. A target recursion depth is calculated for the graph based on a fanout of the graph. In an embodiment, the target recursion depth is calculated by summing the fanout at each recursion depth of the graph multiplied by a number of nodes at each recursion depth of the graph. An estimated number of rows that the recursive query will return is estimated based on the target recursion depth.Type: GrantFiled: October 5, 2012Date of Patent: April 15, 2014Assignee: International Business Machines CorporationInventors: Lynnette E. Carston, Brian R. Muras, Andrew P. Passe
-
Publication number: 20140101128Abstract: In an embodiment, a recursive query is received that comprises a first select statement with a seed select statement and a second select statement with a recursive reference, wherein the recursive query further identifies at least two columns in at least one table, wherein the at least two columns have parent-child relationships represented by nodes in a graph, wherein the graph represents the organization of values in rows in the at least one table. A target recursion depth is calculated for the graph based on a fanout of the graph. In an embodiment, the target recursion depth is calculated by summing the fanout at each recursion depth of the graph multiplied by a number of nodes at each recursion depth of the graph. An estimated number of rows that the recursive query will return is estimated based on the target recursion depth.Type: ApplicationFiled: October 5, 2012Publication date: April 10, 2014Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Lynnette E. Carston, Brian R. Muras, Andrew P. Passe
-
Patent number: 8312007Abstract: Embodiments of the invention provide techniques for optimizing database queries for energy efficiency. In general, a query optimizer is configured to compare energy requirements of query plans, and to select a query plan requiring minimal energy to execute. In one embodiment, the query optimizer may also compare time performance of the query plans, and may select a query plan by matching to a user preference for a relative priority between energy requirements and time performance.Type: GrantFiled: May 8, 2008Date of Patent: November 13, 2012Assignee: International Business Machines CorporationInventors: Robert J. Bestgen, Wei Hu, Shantan Kethireddy, Andrew P. Passe, Ulrich Thiemann
-
Publication number: 20120198423Abstract: Methods, systems, and products are provided for code path tracking. Embodiments include identifying an instrumented trace point in software code to be path tracked; identifying a function executed at the instrumented trace point in the software code; identifying parameters for the function executed at the instrumented trace point; and recording a description of the function, the parameters, and the result of the execution of the function using the parameters.Type: ApplicationFiled: April 10, 2012Publication date: August 2, 2012Applicant: International Business Machines CorporationInventors: Robert J. BESTGEN, Robert D. DRIESCH, JR., Wei HU, Shantan KETHIREDDY, Edward J. MILLER, Andrew P. PASSE, Ulrich THIEMANN
-
Patent number: 8214807Abstract: Methods, systems, and products are provided for code path tracking. Embodiments include identifying an instrumented trace point in software code to be path tracked; identifying a function executed at the instrumented trace point in the software code; identifying parameters for the function executed at the instrumented trace point; and recording a description of the function, the parameters, and the result of the execution of the function using the parameters.Type: GrantFiled: January 10, 2007Date of Patent: July 3, 2012Assignee: International Business Machines CorporationInventors: Robert J. Bestgen, Robert D. Driesch, Jr., Wei Hu, Shantan Kethireddy, Edward J. Miller, Andrew P. Passe, Ulrich Thiemann
-
Patent number: 7941426Abstract: Techniques for optimizing database queries for energy efficiency. A query optimizer is configured to compare energy requirements of query plans, and to select a query plan requiring minimal energy to execute. The query optimizer may also compare time performance of the query plans, and may select a query plan by matching to a user preference for a relative priority between energy requirements and time performance.Type: GrantFiled: May 8, 2008Date of Patent: May 10, 2011Assignee: International Business Machines CorporationInventors: Robert J. Bestgen, Wei Hu, Shantan Kethireddy, Andrew P. Passe, Ulrich Thiemann
-
Patent number: 7937385Abstract: A plan for executing a query in a relational database is obtained. A query for accessing data in the relational database is received. The query specifies N tables in the relational database from which data is to be retrieved. A determination is made whether a syntax of the query matches a syntax of a plan in a plan cache for executing the query. Matches are identified between generic table formats of the N tables specified in the query to generic table formats of N tables specified in the plan responsive to the syntax of the query matching the syntax of a plan in the plan cache for executing the query. The plan for executing the query is obtained based on whether the syntax of the query matches the syntax of the plan and based on identified matches between the generic table formats of the N tables specified in the query to the generic table formats of the N tables specified in the plan.Type: GrantFiled: May 5, 2008Date of Patent: May 3, 2011Assignee: International Business Machines CorporationInventors: Robert J. Bestgen, Wei Hu, Shantan Kethireddy, Andrew P. Passe, Ulrich Thiemann
-
Publication number: 20090282272Abstract: Embodiments of the invention provide techniques for optimizing database queries for energy efficiency. In general, a query optimizer is configured to compare energy requirements of query plans, and to select a query plan requiring minimal energy to execute. In one embodiment, the query optimizer may also compare time performance of the query plans, and may select a query plan by matching to a user preference for a relative priority between energy requirements and time performance.Type: ApplicationFiled: May 8, 2008Publication date: November 12, 2009Inventors: Robert J. Bestgen, Wei Hu, Shantan Kethireddy, Andrew P. Passe, Ulrich Thiemann
-
Publication number: 20090281986Abstract: Embodiments of the invention provide techniques for optimizing database queries for energy efficiency. In general, a query optimizer is configured to compare energy requirements of query plans, and to select a query plan requiring minimal energy to execute. In one embodiment, the query optimizer may also compare time performance of the query plans, and may select a query plan by matching to a user preference for a relative priority between energy requirements and time performance.Type: ApplicationFiled: May 8, 2008Publication date: November 12, 2009Inventors: Robert J. Bestgen, Wei Hu, Shantan Kethireddy, Andrew P. Passe, Ulrich Thiemann
-
Publication number: 20090281992Abstract: Embodiments of the invention provide techniques for optimizing database queries for energy efficiency. In general, a query optimizer is configured to compare energy requirements of query plans, and to select a query plan requiring minimal energy to execute. In one embodiment, the query optimizer may also compare time performance of the query plans, and may select a query plan by matching to a user preference for a relative priority between energy requirements and time performance.Type: ApplicationFiled: May 8, 2008Publication date: November 12, 2009Inventors: Robert J. Bestgen, Wei Hu, Shantan Kethireddy, Andrew P. Passe, Ulrich Thiemann
-
Publication number: 20090276394Abstract: A plan for executing a query in a relational database is obtained. A query for accessing data in the relational database is received. The query specifies N tables in the relational database from which data is to be retrieved. A determination is made whether a syntax of the query matches a syntax of a plan in a plan cache for executing the query. Matches are identified between generic table formats of the N tables specified in the query to generic table formats of N tables specified in the plan responsive to the syntax of the query matching the syntax of a plan in the plan cache for executing the query. The plan for executing the query is obtained based on whether the syntax of the query matches the syntax of the plan and based on identified matches between the generic table formats of the N tables specified in the query to the generic table formats of the N tables specified in the plan.Type: ApplicationFiled: May 5, 2008Publication date: November 5, 2009Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Robert J. Bestgen, Wei Hu, Shantan Kethireddy, Andrew P. Passe, Ulrich Thiemann
-
Publication number: 20090077013Abstract: A method, system, and computer program product for user-driven targeted query re-optimizations using delta values are provided. The method includes displaying a query tree for a query via a graphical user interface (GUI), where the query tree includes a plurality of interconnected nodes in a tree structure, and outputting a delta value as a difference between an estimated and an actual performance metric of query execution. The method also includes receiving a request to provide alternative execution plans for a subtree of a selected node of the query tree, and displaying at least one alternative execution plan description for the subtree of the selected node. The method further includes receiving a re-optimization request for a user selected alternative execution plan description, and displaying a re-optimized query tree resulting from the re-optimization request.Type: ApplicationFiled: September 19, 2007Publication date: March 19, 2009Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Wei Hu, Shantan Kethireddy, Andrew P. Passe, Ulrich Thiemann
-
Publication number: 20080183684Abstract: Methods, apparatus, and products are disclosed for caching an access plan for a query that include: receiving, in a SQL module of a DBMS, a SQL query that specifies data for retrieval from a database, the database characterized by database statistics, the SQL query characterized by one or more host variable values; generating, by the SQL module, an access plan in dependence upon the SQL query; calculating, by the SQL module, a routing code for the SQL query in dependence upon the host variable values of the SQL query and a portion of the database statistics; and storing, by the SQL module, the access plan in an access plan cache, including associating with the access plan the routing code for the SQL query and the portion of the database statistics used to calculate the routing code.Type: ApplicationFiled: January 26, 2007Publication date: July 31, 2008Inventors: Robert J. Bestgen, Michael S. Faunce, Wei Hu, Shantan Kethireddy, Andrew P. Passe, Ulrich Thiemann