Brian Robert Muras

US Patent:

7133861, Nov 7, 2006

Filed:

Dec 4, 2003

Appl. No.:

10/727420

Inventors:

Paul Reuben Day - Rochester MN, US
Brian Robert Muras - Rochester MN, US
Anne Marie Ryg - Mantorville MN, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 7/00
G06F 17/00
G06F 17/30

US Classification:

707 2, 707 3, 707102

Abstract:

A method, apparatus and system that in an embodiment detect that a trigger exists, where the trigger indicates a potential need to rebuild a saved query access plan, and determine whether a previous job associated with the trigger created a new access plan that was identical to the saved access plan. If a previous job associated with the trigger has already created the new access plan and found that it was identical to the saved access plan, then the query is performed with the saved access plan, since there is no advantage to be gained by creating the new access plan again. In this way, multiple jobs are kept from repeatedly re-creating an access plan that is identical to one that already exists.

US Patent:

7191174, Mar 13, 2007

Filed:

May 22, 2003

Appl. No.:

10/443921

Inventors:

Paul Reuben Day - Rochester MN, US
Brian Robert Muras - Rochester MN, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 7/00
G06F 17/30

US Classification:

707 5, 707 2, 707 3

Abstract:

A method, a query optimizer, and computer program product are provided for implementing live switchover to a temporary sparse index for faster query performance. A first plan using an existing index is used for processing a query. A temporary sparse index is built for the query simultaneously with the first plan processing the query. When the temporary sparse index is built, processing the query with the first plan is stopped and a live switchover to the temporary sparse index is provided. Then a second plan using the temporary sparse index is used to continue processing the query at a point where processing stopped with the first plan.

US Patent:

7296189, Nov 13, 2007

Filed:

Sep 19, 2003

Appl. No.:

10/664553

Inventors:

Paul Reuben Day - Rochester MN, US
Brian Robert Muras - Rochester MN, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 11/00

US Classification:

714 38, 714 25

Abstract:

A method, apparatus and computer program product are provided for implementing autonomic testing and verification of software fix programs or program temporary fixes (PTFs). A software fix program including multiple patches or a program temporary fix (PTF) including multiple programs is received. Each patch or program of the multiple patches or multiple programs of the software fix program or PTF is sequentially applied to a software product. The software product is tested responsive to each sequentially applied patch or program. Then next iterations or different combinations of patches or programs are sequentially applied to a software product and then the software product is tested responsive to each of the applied iterations.

US Patent:

7308437, Dec 11, 2007

Filed:

Oct 22, 2003

Appl. No.:

10/691296

Inventors:

Paul Reuben Day - Rochester MN, US
Brian Robert Muras - Rochester MN, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 17/30

US Classification:

707 2, 707 3, 707 4, 707 5, 707200

Abstract:

An apparatus, program product and method utilize the retrieval status of a resource to generate an access plan for a database query that uses the resource. The retrieval status, which indicates, for example, what percentage of a given resource is already stored in working memory, and thus need not be separately retrieved during query execution, may be used to generate more accurate input/output cost estimates for access plans, and thus enable a query optimizer to better select an access plan that is optimal under given runtime conditions.

US Patent:

7313553, Dec 25, 2007

Filed:

Mar 31, 2004

Appl. No.:

10/815231

Inventors:

Michael S. Faunce - Rochester MN, US
Brian Robert Muras - Rochester MN, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 17/30

US Classification:

707 2, 707 4, 707 5

Abstract:

A database query optimizer determines when no optimal index for a query exists, determines whether a sub-optimal index exists, and if so, uses statistical information for each additional key in the sub-optimal index to rewrite the query in a manner that allows traversing the sub-optimal index. The sub-optimal index is then probed using the rewritten query, and the number of estimated returned rows is then used to optimize the query.

US Patent:

7321888, Jan 22, 2008

Filed:

Sep 11, 2003

Appl. No.:

10/660166

Inventors:

Paul Reuben Day - Rochester MN, US
Brian Robert Muras - Rochester MN, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 17/30

US Classification:

707 2, 707 3, 707 5, 707100, 7071041

Abstract:

A database engine and a system running a database engine utilize a dynamic join reordering feature to change the order of two or more join operations while a query is executing. The database engine starts execution of the query with an initial join order setting but monitors the execution of the query to determine whether the initial join order or some other join order would provide better runtime performance. If another join order would provide better performance, then the database engine can change the join order during query execution and complete the query using the new join order.

US Patent:

7337167, Feb 26, 2008

Filed:

Apr 14, 2005

Appl. No.:

11/106009

Inventors:

Brian Robert Muras - Rochester MN, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 17/30

US Classification:

707 3, 707 4, 707 2

Abstract:

A method, apparatus, system, and signal-bearing medium that, in an embodiment, estimate a number of rows that a recursive query will retrieve from a table by recursively probing an index associated with the table. A recursive query includes a seed and a recursive predicate, each of which is associated with a respective column in the table. If the index has a leading column that matches the table column associated with the seed, and the index has a secondary column that matches the table column associated with the recursive predicate, then the index is recursively probed until a threshold depth of the recursive probing is reached or until all nodes of the index have been examined. The estimated number of rows that the recursive query will retrieve is then calculated based on either the number of rows examined in the index (if the threshold depth has not been reached) or based on the threshold depth, a cardinality of the secondary column, and a cardinality of the primary column (if the threshold depth has been reached). If the index does not have a leading column that matches the table column associated with the seed, an index is found that has a recursive and non-recursive columns that match columns that are compared by the recursive predicate. The minimum value of the leading column is then used to start recursively probing up the index, and the estimated number of rows is calculated based on the maximum depth (or average depth in another embodiment) of the recursion, a cardinality of the recursive column, and a cardinality of the non-recursive column.

US Patent:

7343367, Mar 11, 2008

Filed:

May 12, 2005

Appl. No.:

11/128053

Inventors:

Brian Robert Muras - Rochester MN, US
Robert Russell Nelson - Rochester MN, US
John Matthew Santosuosso - Rochester MN, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 7/00
G06F 17/30

US Classification:

707 2, 707 4, 707 5, 707 7

Abstract:

An apparatus and method to optimize a query access plan in a computer database system. In preferred embodiments, the query optimizer determines the query can be optimized and generates for the query an optimized access plan that eliminates records defined by a Where clause and one or more ordering criteria prior to ordering the records (sorting or grouping) and then returning a first n rows.