International Business Machines Corporation

Robert J Bestgen

Shantan Kethireddy

Daniel Beuch

Ulrich Thiemann

Andrew Peter Passe

Wei Hu

Robert Victor Downer

Jeffrey Wayne Tenner

Mark John Anderson

James Michael Flanagan

Scott Forstie

John Matthew Santosuosso

Brian Robert Muras

David Glenn Carlson

John David Dietel

Kathryn Rose Steinbrink

Thomas James Schreiber

Gene R Cobb

Curtis Neal Boger

Robert D Andrews

Eric L Barsness

Randy Lynn Egan

Robert Douglas Driesch, Jr

Thomas Owen McKinley

Carol Ledermann Ramler

Thomas John Eggebraaten

Michael D Pfeifer

Kevin James Kathmann

Lance Christopher Amundsen

Thomas Paul Giordano

Michael W Cain

Edward J Miller

Daniel Virgil Toft

Jian Li

Rafal Przemyslaw Konik

Roger Alan Mittelstadt

Xing Xing Shen

Michael Steven Faunce

Richard Dale Hoffman

Yi Yuan

Nicholas Todd Lawrence

Shawn Joseph Baranczyk

Abdo Esmail Abdo

David Rolland Welsh

Scott Joseph Heimer

Barry Warren Knapp

Dag O Roppe

Michael S France

A sequence object manager provides a sequence object with a dynamic cache block size that indicates a block size of values to be added to the sequence object when the cache values are exhausted. The dynamic block size allows the sequence object manager to optimize performance and storage space depending on applications using the sequence object. The dynamically block size is set and maintained by the sequence object manager based on observed performance and historical trends of the applications. A seed value may be provided by the user to initially set the dynamic block size.

Database sequence object having a dynamic cache block size

Techniques are disclosed for allowing administrators to manage runtime environments (RTEs). An RTE configuration component prompts for metadata characterizing a plurality of dynamically configurable runtime environments (RTE) for executing data queries. The RTE configuration component generates an RTE definition to associate with each of the plurality of RTEs. When a query is received for execution, the RTE configuration component dynamically configures the server computing system for query execution according to a selected one of the plurality of RTE definitions.

Profile-enabled dynamic runtime environment for web application servers

A method for processing a database query includes receiving a database query to be executed according to a first processing profile and determining whether the database query is likely to be an ad hoc query. The determining of whether the database query is likely to be an ad hoc query is based on a factor. The factor can include a query originator factor, a job type factor, a run history factor, or a query quality factor. A second processing profile is generated before executing the database query in response to determining that the database query is likely to be an ad hoc query. The second processing profile is configured to limit performance impacts, such as by providing a lower execution priority, prohibiting parallel database operations, limiting memory allocation, or delaying or blocking the query.

Autonomic identification and handling of ad-hoc queries to limit performance impacts

Techniques are disclosed for allowing users to access data libraries associated with multiple, isolated runtime environments (RTEs). A web query application receives a query and determines an RTE to execute the query against. The web query application determines whether a current RTE matches the determined RTE. If the web query application determines that the current RTE does not match the determined RTE, the web query application configures a server computing system to access the determined RTE and execute the query against data libraries associated with the determined RTE. If the web query application determines that the current RTE matches the determined RTE, the web query application executes the query against the data libraries associated with the current RTE.

Dynamic runtime environment configuration for query applications

Method to order query results, by processing a received query at least in part using a composite key index, wherein the composite key index comprises at least two key columns, wherein the at least two key columns comprise at least one pre-ordering column and an ordering column, wherein the query specifies ordering criteria to order a result set based on values of the ordering column, wherein the processing comprises receiving, from the composite key index, an ordering column value for each unique pre-ordering column value in the composite key index, identifying a first ordering column value as being ordered first according to the ordering criteria, and returning the first ordering column value as being responsive to the query.

Index merge ordering

System, method, and computer program product to order query results, by processing a received query at least in part using a composite key index, wherein the composite key index comprises at least two key columns, wherein the at least two key columns comprise at least one pre-ordering column and an ordering column, wherein the query specifies ordering criteria to order a result set based on values of the ordering column, wherein the processing comprises receiving, from the composite key index, an ordering column value for each unique pre-ordering column value in the composite key index, identifying a first ordering column value as being ordered first according to the ordering criteria, and returning the first ordering column value as being responsive to the query.

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.

Code path tracking

A method, apparatus and program product are provided for performing a query of a database. A database query is received, which includes first and second operations respectively configured to generate first and second disjoint results sets from a dataspace. The database query is analyzed to identify a set of attributes from the dataspace that are used by at least one of the first and second operations in the database query. During execution of the database query, a plurality of records from the dataspace is iteratively processed in a single pass, including, for each of the plurality of records, processing such record by retrieving the plurality of attributes for such record from the dataspace and performing each of the first and second operations on the record using the retrieved attributes for such record to build the first and second disjoint results sets.

Multiple result sets generated from single pass through a dataspace

A method, system, and computer program product to efficiently maintain a database is disclosed. The method, system, and computer program product may include structuring the database to have a table, an index associated with the table, and a log associated with the index. The method, system, and computer program product may include receiving a maintenance request related to the index. The method, system, and computer program product may include accounting for the maintenance request when the index is being searched. The method, system, and computer program product may include adding the maintenance request to the log when the index is not being searched.

Management of updates in a database system

A method and system of managing a database is disclosed. The database may be structured to include a sequence object. The sequence object can have a set of sequential values. The set of sequential values may be used as a set of key values for a set of jobs. A count of jobs accessing the sequence object may be monitored. Based on the count of jobs accessing the sequence object, a quantity of sequential values of the set of sequential values may be allocated.

Using a sequence object of a database

A method, system, and computer program product to efficiently delete data from a database is disclosed. The method, system, and computer program product may include structuring the database to have a plurality of tables having indexes to related rows and having keys with key values associated with particular rows. The method, system, and computer program product may include deleting rows in the database tables by deleting keys in indexes related to the rows in an order such that corresponding rows are deleted based on relation to the keys. The method, system, and computer program product may include ordering the rows to be deleted based on concepts such as hierarchy, spatial locality, temporal locality, frequency of access, number of rows, and value uniqueness. Comparatively closely related relationships may be prioritized to be deleted.

Database management delete efficiency

Growing community of inventors

Rochester, MN, United States of America

Robert J Bestgen