International Business Machines Corporation

Other

John Joseph Campbell

Maryela Evelin Weihrauch

Charles Roy Bonner

Frances Hwa Villafuerte

Terence Patrick Purcell

Nigel G Slinger

You-Chin Gene Fuh

John Benjamin Tobler

Patrick Dooling Bossman

Daniel Kozin

David Arlen Elko

David Harold Surman

Thomas Abel Beavin

James Zu-Chia Teng

Fen-Ling Lin

Jeffrey William Josten

Andrei Fedorovich Lurie

Akira Shibamiya

Bryan Frederick Smith

Tammie Dang

Claire Willey McFeely

Haakon Roberts

Shengxi Suo

Adarsh R Pannu

Frank Darl Bower

Julie Chen

Thomas Eng

Euna Park

Saghi Amirsoleymani

Terrence P Purcell

Michael John Bracey

Aspects of the invention include techniques for providing a schema evolution on a live database system without an outage. A non-limiting example method includes initiating a schema change on a live database system. The schema change includes an attribute for a database object. A first application package having a user application that is dependent on the database object and that is bound with a release(deallocate) option is identified. Existing threads and new threads executing the first application package are routed to execute the first application package with a release(commit) option and the schema change on the live database system is completed. One or more additional threads concurrently executing one or more additional application packages remain executing with the release(deallocate) option.

Schema evolution on a live database system without an outage

Disclosed aspects relate to index maintenance management of a relational database management system having a set of indexes. A subset of the set of indexes, which is indicated as a non-critical index subset, is detected with respect to the set of indexes. Related to maintenance of the subset of the set of indexes, a determination is made to perform an index maintenance impact action. Corresponding to the subset of the set of indexes, the index maintenance impact action is performed.

Index maintenance management of a relational database management system

Rows are inserted in a database table on a page having a first space reserved for inserting rows of the database table. A second space is reserved for updating data of the inserted rows, wherein reserving the second space includes reserving the second space on the page responsive to inserting each of the rows.

Free space management in a database

According to one embodiment of the present invention, a system compares database transactions to corresponding performance information to identify conforming database transactions with an acceptable deviation from the performance information and outlier database transactions beyond the acceptable deviation from the performance information. The system aggregates information from a threshold quantity of conforming database transactions into an aggregated record, wherein the threshold quantity is dynamically adjusted, and generates a record for each outlier database transaction, wherein conditions for identifying the outlier database transactions are dynamically adjusted. Embodiments of the present invention further include a method and computer program product for managing database transactions in substantially the same manners described above.

Managing transactional data for high use databases

A row is inserted in a database table on a page having a first space reserved for inserting rows of the database table. A second space is reserved for adding data to the inserted row, wherein reserving the second space includes reserving the second space on the page responsive to inserting the row, so that the amount of space reserved for adding data to inserted rows grows as more rows are inserted. The page is marked full for the second space independently of whether the first space is full for inserting new rows. Data is added to rows on the page, responsive to detecting that the second space is full, by adding the data to one or more new pages, even though rows may still be inserted on the page using any remaining room in the first space on the page.

A row is inserted in a database table on a page having a first space reserved for inserting rows of the database table. A second space is reserved for adding data to the inserted row, wherein reserving the second space includes reserving the second space on the page responsive to inserting the row.

A method for performing disjunctive single-index access on a database is disclosed. The method includes a query engine determining whether a first OR predicate and a second OR predicate map to a shared index. Responsive to the query engine determining that the first OR predicate and the second OR predicate map to the shared index, the first OR predicate and the second OR predicate are ordered in an ascending sequence. A first range of the first OR predicate is queued. A first row of the shared index is probed for the first range of the first OR predicate. Whether the first row is disqualified by the first OR predicate is determined. Responsive to determining that the first row is not disqualified by the first OR predicate, the row is reported in a result reporting structure. Responsive to determining that the row is disqualified by the first OR predicate, whether the first range of the first OR predicate overlaps a second range of the second OR predicate is determined, and, responsive to determining that the first range of the first OR predicate overlaps the second range of the second OR predicate, the row is checked against second range of the second or predicate.

Method and system for disjunctive single index access

An apparatus, system, and method are disclosed for ensuring query execution plan stability in a database management system. The present invention binds a static database query to a new query execution plan (QEP) that produces the same result set as an original QEP bound to the static database query. Next, the present invention identifies one of the original QEP and the new QEP as a primary QEP and automatically collects execution statistics for the original QEP and the new QEP. Finally, the present invention automatically selects one of the original QEP and the new QEP as the primary QEP in response to completion of the automatic collection of execution statistics, the primary QEP selected such that the automatically selected QEP provides optimal execution performance based on performance criteria in comparison to the automatically unselected QEP, the primary QEP selected based on the execution statistics.

Apparatus, system, and method for ensuring query execution plan stability in a database management system

An apparatus for collecting particulate material has a collection tray () and a fire-resistant collection reservoir (). A scraper blade () is attached to a carriage () which is arranged to be driven by an electrical motor along the base of the tray () so as to sweep particulate material into the reservoir (). A pivotal lid normally closes an opening into the reservoir () until the scraper blade is ready to sweep particulate material into the reservoir, whereupon the lid is opened to receive the swept particulate material. Actuation of the lid for the reservoir may be operated by electro-mechanical switches or by a solenoid ().

Apparatus for collecting particulate material

A method and article of manufacture, implementing the method, allocates space for a dataset. The dataset has an initial area and zero or more additional allocated areas to provide space for storing the dataset. The size of a new additional area is determined. The new additional area is associated with a new area number, and the size of the new additional area is based on the new area number. Additional space for the dataset is allocated based on the size of the new additional area.

Computer-implemented method for allocating new additional area for the dataset in storage based on the size of the new additional area wherein if the new area number does not exceed clipping threshold, the size of a new additional area being greater than the size of each previously allocated additional area of the dataset

Disclosed is a system, method, and program for transferring data. When a transaction commits, multiple data objects that have been changed by the transaction are identified. The multiple data objects are written from local storage to a cache structure using a batch write command. When changed data objects at a first system that are not cached in the shared external storage are written to disk, a batch cross invalidation command is used to invalidate the data objects at a second system. Additionally, multiple data objects are read from the cache structure into a processor storage using a batch castout command.

Growing community of inventors

Alton, United Kingdom

John Joseph Campbell