Roger A Mittelstadt from 405 11Th Ave NW, Byron, MN 55920, age 56, Phone: 5077752532

Us Patents

Intelligent Job Functionality
view source
US Patent:

7882399, Feb 1, 2011
Filed:

Dec 13, 2007
Appl. No.:

11/955465
Inventors:

Paul Reuben Day - Rochester MN, US
Roger Alan Mittelstadt - Byron MN, US
Brian Robert Muras - Rochester MN, US
Anne Marie Ryg - Mantorville MN, US
Assignee:

International Business Machines Corporation - Armonk NY
International Classification:

G06F 11/00
US Classification:

714 38, 714 15, 714 16
Abstract:

A method, apparatus, and program product utilize intelligent job functionality to diagnose an error in a computer. After detecting an error in a first job processing a task, and in response to another attempt to perform the task, a job selection algorithm selects a predetermined job in which to perform the task and diagnose the error. The predetermined job can be the first job or a new job associated with a signature that corresponds to the task that experienced the error. The predetermined job can be used to diagnose the error in a debugging session. Alternately, the first job may enter a debug session immediately after experiencing an error.

Implementing Dynamic Processor Allocation Based Upon Data Density
view source
US Patent:

8015191, Sep 6, 2011
Filed:

Mar 27, 2008
Appl. No.:

12/056879
Inventors:

Paul R. Day - Rochester MN, US
Randy L. Egan - Rochester MN, US
Roger A. Mittelstadt - Byron MN, US
Assignee:

International Business Machines Corporation - Armonk NY
International Classification:

G06F 7/00
US Classification:

707745, 707803, 711100, 711173, 345505
Abstract:

Dynamic processor allocation is implemented based upon bitmap data density. A bitmap index is used to process the query. A bitmap is created for the query. The bitmap is partitioned into single I/O operations. A variable partition size is provided based upon data density. Data density for each partition is calculated. Processors are assigned based upon data density of each partition. Then the partitions are processed and query results are returned.

Database Query Optimization Using Weight Mapping To Qualify An Index
view source
US Patent:

8140517, Mar 20, 2012
Filed:

Apr 6, 2009
Appl. No.:

12/419039
Inventors:

Paul R. Day - Rochester MN, US
Randy L. Egan - Rochester MN, US
Roger A. Mittelstadt - Byron MN, US
Dale M. Stahl - Rochester MN, US
Assignee:

International Business Machines Corporation - Armonk NY
International Classification:

G06F 7/00
G06F 17/30
US Classification:

707713, 707715, 707748, 707E17017, 707E17131
Abstract:

A method, apparatus, and program product is provided to, in response to receiving a first database query for which usage of shared weight indices is prohibited, determine whether a shared weight index associated with a column of a database table referenced by the first database query can be utilized as a non-shared weight index to optimize the database query. The method, apparatus, and program product determine whether the column includes at least one changed weight value and determines whether the database query references at least one changed weight value in the column. The shared weight index is utilized to optimize the first database query in response to determining that the shared weight index can be utilized as a non-shared weight index to optimize the first database query.

Embedding Densities In A Data Structure
view source
US Patent:

8140520, Mar 20, 2012
Filed:

May 15, 2008
Appl. No.:

12/120773
Inventors:

Paul R. Day - Rochester MN, US
Randy L. Egan - Rochester MN, US
Roger A. Mittelstadt - Byron MN, US
Assignee:

International Business Machines Corporation - Armonk NY
International Classification:

G06F 17/30
US Classification:

707715
Abstract:

A method, apparatus and program product that determine a density for each key value of a plurality of key values in a table over at least one range of rows in the database table, and store the determined densities in a data structure for use in optimizing a query that references a key value in the plurality of key values in the table. By doing so, the density of various key values may be determined and dynamically maintained, often resulting in optimization data for improved query optimization.

Determining A Density Of A Key Value Referenced In A Database Query Over A Range Of Rows
view source
US Patent:

8275761, Sep 25, 2012
Filed:

May 15, 2008
Appl. No.:

12/120706
Inventors:

Paul R. Day - Rochester MN, US
Randy L. Egan - Rochester MN, US
Roger A. Mittelstadt - Byron MN, US
Assignee:

International Business Machines Corporation - Armonk NY
International Classification:

G06F 7/00
US Classification:

707713, 707718
Abstract:

A method, apparatus and program product that determine a density of a key value referenced in a database query over at least one range of rows, and utilize the determined density to optimize the database query. By doing so, the density of various key values may be determined and compared, and a bit map may be generated over the range of rows of the key value that is denser, resulting in a reduction of resources to build and use the bit map. Moreover, from the bit map over the range of rows to be selected after using the determined density, dense regions may be identified that can be used to optimize block I/O's according to the number of rows to be selected based on the query.

Executing A Query Plan With Display Of Intermediate Results
view source
US Patent:

8290936, Oct 16, 2012
Filed:

Aug 17, 2010
Appl. No.:

12/857873
Inventors:

Paul R. Day - Rochester MN, US
Randy L. Egan - Rochester MN, US
Roger A. Mittelstadt - Byron MN, US
Brian R. Muras - Rochester MN, US
Assignee:

International Business Machines Corporation - Armonk NY
International Classification:

G06F 17/30
G06F 7/00
US Classification:

707718, 707714
Abstract:

In an embodiment, a FIRSTIO execution plan is selected that has a lowest estimated execution time for finding a number of records that satisfy the query and are simultaneously viewable. An ALLIO execution plan is selected that has a lowest estimated execution time for finding all records that satisfy the query. The FIRSTIO execution plan is executed for a first time period to create a FIRSTIO result set. The ALLIO execution plan is executed for a second time period to create an ALLIO result set. The FIRSTIO result set is displayed if the FIRSTIO result set comprises more records than the ALLIO result set. The ALLIO result set is displayed if the ALLIO result set comprises more records than the FIRSTIO result set. In an embodiment, the first and second time periods expire in response to the expiration of a maximum time specified by the query.

Using A Partially Built Index In A Computer Database System
view source
US Patent:

8380701, Feb 19, 2013
Filed:

Sep 2, 2011
Appl. No.:

13/225058
Inventors:

Rafal P. Konik - Oronoco MN, US
Roger A. Mittelstadt - Byron MN, US
Brian R. Muras - Rochester MN, US
Mark W. Theuer - Rochester MN, US
Assignee:

International Business Machines Corporation - Armonk NY
International Classification:

G06F 7/00
G06F 17/30
US Classification:

707713, 707715, 707736, 707741
Abstract:

A partially built index is used in a computer database system. When a database index is being built, or rebuilt, the database manager keeps track of the records processed using a relative row number (RRN) to track what part of the partially built index is complete. Queries are optimized by a query optimizer associated with the database manager that uses the portion of the index that is complete with reference to the RRN. The remainder of the database table beyond the RRN can be estimated or implemented using the completed data or can be determined by searching the relevant portion of the database table.

Feedback Loop Between A Query Optimizer And A Cache Manager
view source
US Patent:

8380703, Feb 19, 2013
Filed:

Jul 26, 2010
Appl. No.:

12/843418
Inventors:

Randy L. Egan - Rochester MN, US
Rafal P. Konik - Oronoco MN, US
Roger A. Mittelstadt - Byron MN, US
Mark W. Theuer - Rochester MN, US
Assignee:

International Business Machines Corporation - Armonk NY
International Classification:

G06F 7/00
G06F 17/30
US Classification:

707716, 707718, 707719
Abstract:

Systems, methods and computer program products are disclosed for managing a database cache. In one embodiment, access to a data object stored in a database is monitored. A memory residency priority for the data object is determined, based on the access patterns. Further, an access plan is determined for a query, based on the memory residency priority. Access to the data object is also monitored when the access plan is executed, thereby providing a feedback loop between determining memory residency priorities and determining query access plans.