David C Carlson

US Patent:

6910032, Jun 21, 2005

Filed:

Jun 7, 2002

Appl. No.:

10/165235

Inventors:

David Glenn Carlson - Rochester MN, US
Tariq Mahmood Choudhry - Rochester MN, US
Kevin James Kathmann - Rochester MN, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F017/30

US Classification:

707 3, 4 5

Abstract:

An apparatus, program product and method utilize a dynamically-populated query buffer to facilitate the handling of at least a portion of a database query in parallel. A query is implemented using at least first and second portions, where the second portion of the query is executed in parallel using a plurality of threads. The first portion of the query is executed to dynamically populate a query buffer with records from a data source, and the plurality of threads that execute the second portion of the query are specified to the query buffer so that the effective data source for the second portion of the query comprises the records that are dynamically populated into the query buffer.

US Patent:

6915291, Jul 5, 2005

Filed:

Jun 7, 2002

Appl. No.:

10/165293

Inventors:

David Glenn Carlson - Rochester MN, US
David Lee Hermsmeier - Oronoco MN, US
Kevin James Kathmann - Rochester MN, US
Thomas Owen McKinley - Rochester MN, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F017/30
G06F017/00

US Classification:

707 2, 707 3, 707 4, 707102, 715514

Abstract:

An apparatus, program product and method represent a database query access plan a query execution data structure including a plurality of query node objects arranged into a tree relationship to define a parent node object and at least one child node object, and an attribute data structure that references a plurality of attributes utilized by the query execution data structure. At least one of the parent and child node objects includes an attribute operation data structure configured to manipulate at least a subset of the plurality of attributes in the attribute data structure by accessing the attribute operation data structure. By partitioning the functionality of a query access plan into a collection of node objects and an attribute data structure, and then providing within at least a subset of the node objects attribute operation data structures that manipulate the attribute data structure, the resulting query engine architecture becomes significantly extendible and adaptable. Moreover, through appropriate selection of attribute operations, and coding of such operations using directly executable program code, optimal query engine performance may also be obtained.

US Patent:

6961309, Nov 1, 2005

Filed:

Apr 25, 2001

Appl. No.:

09/843058

Inventors:

David G. Carlson - Rochester MN, US
Paul R. Chmielewski - Byron MN, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

H04L012/26

US Classification:

370235, 370236

Abstract:

This invention relates to reception and transmission of data over a network. More specifically, this invention relates to Transmission Control Protocol's delayed acknowledgment and improving transmission throughput by adaptively adjusting the use of delayed acknowledgment.

US Patent:

6999958, Feb 14, 2006

Filed:

Jun 7, 2002

Appl. No.:

10/165025

Inventors:

David Glenn Carlson - Rochester MN, US
Kevin James Kathmann - Rochester MN, US
Lawrence Kenneth Nash - Madison WI, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 17/30

US Classification:

707 3, 707 1, 707 4, 707 5

Abstract:

An apparatus, program product and method perform runtime query optimization during execution of a query to select from among multiple available plans, or implementations, capable of implementing the query. The runtime query optimization utilizes a runtime-derived performance criterion to dynamically select from among multiple query implementations. A performance criterion is dynamically evaluated during execution of at least a portion of a query, and one of a plurality of query implementations defined in the query is selected based upon the dynamically-evaluated performance criterion. Once selected, execution of the query is continued using the selected query implementation.

US Patent:

7089230, Aug 8, 2006

Filed:

Jun 7, 2002

Appl. No.:

10/164767

Inventors:

David Glenn Carlson - Rochester MN, US
Kevin James Kathmann - Rochester MN, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 17/30

US Classification:

707 3, 707 2, 707 10, 707100, 709201, 709208

Abstract:

Methods, systems and articles of manufacture of processing a multi-state attribute field query. One embodiment provides a method of processing a multi-state attribute field query, comprising instantiating a plurality of live objects; performing, by each live object, an attribute operation, wherein at least one attribute operation is a comparison operation associated with attributes of the query. The plurality of live objects access a global status storage area only when an operand of the comparison operation is null or error. In any case, execution control is passed from each live object to an adjacent live object.

US Patent:

7136848, Nov 14, 2006

Filed:

Aug 29, 2002

Appl. No.:

10/230641

Inventors:

David Glenn Carlson - Rochester MN, US
Kevin James Kathmann - Rochester MN, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 17/30

US Classification:

707 3, 707 1, 707 4

Abstract:

Previously-optimized database queries are stored in memory. When a new query needs to be optimized, the previously-optimized queries are examined to determine whether the new query has been previously optimized. If the new query has not been previously optimized, the previously-optimized queries are examined to determine whether any previously-optimized queries differ only in data type of one or more operands when compared to the new query. If a previously-optimized query that differs only in data type is located, the previously-optimized query is refreshed to reflect the different data type without the need of optimizing the new query from scratch. Portions of previously-optimized queries may thus be re-used even when a previously-optimized query is not identical to a new query to be optimized. As a result, the performance of query optimization in a database system is increased.

US Patent:

7315855, Jan 1, 2008

Filed:

May 12, 2005

Appl. No.:

11/127647

Inventors:

David Glenn Carlson - Rochester MN, US
Kevin James Kathmann - Rochester MN, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 17/30

US Classification:

707 3, 707 2, 707 4, 707101, 707102

Abstract:

Methods, systems and articles of manufacture of processing a multi-state attribute field query. One embodiment provides a method of processing a multi-state attribute field query, comprising instantiating a plurality of live objects; performing, by each live object, an attribute operation, wherein at least one attribute operation is a comparison operation associated with attributes of the query. The plurality of live objects access a global status storage area only when an operand of the comparison operation is null or error. In any case, execution control is passed from each live object to an adjacent live object.

US Patent:

7512700, Mar 31, 2009

Filed:

Sep 30, 2005

Appl. No.:

11/241708

Inventors:

Robert Joseph Bestgen - Rochester MN, US
David Glenn Carlson - Rochester MN, US
Kevin James Kathmann - Rochester MN, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06K 9/36

US Classification:

709231

Abstract:

A stream data node receives real-time streamed data from one or more input devices, dynamically filters the streamed data to reduce the streamed data, and delivers the reduced data when requested. By providing real-time filtering of the data, the amount of data that must be stored in a database may be substantially reduced. The stream data node can perform aggregation functions, group functions, and select functions, thereby also significantly reducing the amount of data that must be stored in a database. The stream data node may also be part of a query execution data structure, where it delivers its data when requested by another node in the query execution data structure.