Abstract: The invention relates to a method and apparatus for recording and maintaining stored information system object relationship information. Information contained within a stored information system (including system catalogs, referential constraints, triggers, table hierarchies, column references, indexes, stored program packages, system catalogs, stored procedures, stored queries, log/trace files of dynamically executed code, etc.) are searched to identify dependency relationships between objects. This object relationship information is stored and maintained in an information base. Information within the information based may be organized based upon subsets of objects that support a common application, service, or capability.

Abstract: A method, apparatus, and computer program product are disclosed for managing query execution plans for a workload. In one embodiment, the method includes gathering an initial set of performance characteristics generated from a database management system (DBMS) executing a database workload according to one or more query execution plans (QEPs). The database workload includes one or more database statements. The method determines a QEP change for one or more QEPs of the database workload. In addition, the method gathers a subsequent set of performance characteristics generated from the DBMS executing the one or more QEPs of the database workload influenced by the QEP change. Furthermore, the method determines a performance difference created by the QEP change based on the initial set of performance characteristics and the subsequent set of performance characteristics and responds to the performance difference in accordance with a monitoring policy.

Abstract: Techniques are provided for tuning work. In response to identifying a trigger for a work, automatic tuning is invoked. The trigger indicates that a performance goal for the work has been missed. The work is analyzed. A tuning operation is selected for the work based on a tuning history. The selected tuning operation is implemented for the work.

Abstract: A method, apparatus, and computer program product are disclosed for managing query execution plans for a workload. In one embodiment, the method includes gathering an initial set of performance characteristics generated from a database management system (DBMS) executing a database workload according to one or more query execution plans (QEPs). The database workload includes one or more database statements. The method determines a QEP change for one or more QEPs of the database workload. In addition, the method gathers a subsequent set of performance characteristics generated from the DBMS executing the one or more QEPs of the database workload influenced by the QEP change. Furthermore, the method determines a performance difference created by the QEP change based on the initial set of performance characteristics and the subsequent set of performance characteristics and responds to the performance difference in accordance with a monitoring policy.

Abstract: In response to a triggering event, a resilient administrative schedule system recognizes a need to perform an administrative task on one of a set of data servers. A user selects the administrative task. The system determines an operational status of the data server to determine a communication protocol for communicating with the data server, selects the communication protocol based on the operational status of the data server adding the selected administrative task to a task list, and automatically executes the selected administrative task at a predetermined execution time without intervention by a human administrator.

Abstract: The invention relates to a method and apparatus for recording and maintaining stored information system object relationship information. Information contained within a stored information system (including system catalogs, referential constraints, triggers, table hierarchies, column references, indexes, stored program packages, system catalogs, stored procedures, stored queries, log/trace files of dynamically executed code, etc.) are searched to identify dependency relationships between objects. This object relationship information is stored and maintained in an information base. Information within the information based may be organized based upon subsets of objects that support a common application, service, or capability.

Abstract: A method, apparatus, and article of manufacture accesses a dataset using an unsupported access method. A first request to access a dataset is intercepted. The first request is associated with a first data structure that specifies a first access method. The first data structure is replaced with a second data structure that specifies a second access method which is different from the first access method. The dataset is accessed in accordance with the second access method of the second data structure. In another particular embodiment, the first access method is the basic direct access method, and the second access method is any of the basic sequential access method and the queued sequential access method. In yet another embodiment, the dataset is an extended format physical sequential dataset.

Abstract: 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.

Abstract: A method, apparatus, and article of manufacture accesses a dataset using an unsupported access method. A first request to access a dataset is intercepted. The first request is associated with a first data structure that specifies a first access method. The first data structure is replaced with a second data structure that specifies a second access method which is different from the first access method. The dataset is accessed in accordance with the second access method of the second data structure.

Abstract: The invention relates to a method and apparatus for recording and maintaining stored information system object relationship information. Information contained within a stored information system (including system catalogs, referential constraints, triggers, table hierarchies, column references, indexes, stored program packages, system catalogs, stored procedures, stored queries, log/trace files of dynamically executed code, etc.) are searched to identify dependency relationships between objects. This object relationship information is stored and maintained in an information base. Information within the information based may be organized based upon subsets of objects that support a common application, service, or capability.

Abstract: A method, apparatus, and article of manufacture for a computer-implemented apportioning system. Work is distributed to processors in a multi-processor system. Initially, during bind-time, a scaling factor is determined for each processor. The scaling factor represents relative processing power in relation to each other processor. Then, portions of a total amount of work are distributed to each processor based on the determined scaling factor of that processor and a determined amount of work for an average processor.

Abstract: A method, apparatus, and article of manufacture for a computer-implemented apportioning system. Work is distributed to processors in a multi-processor system. Initially, during bind-time, a scaling factor is determined for each processor. The scaling factor represents relative processing power in relation to each other processor. Then, portions of a total amount of work are distributed to each processor based on the determined scaling factor of that processor and a determined amount of work for an average processor.

Abstract: A method, apparatus, and article of manufacture for a computer implemented groupby aggregation system. Groupby aggregation is performed when a statement is executed in a database stored on a data storage device, which is connected to a computer. Initially, data elements are input into a tournament tree from an input sequence. Then, a winner of a tournament in the tournament tree is identified. The winner is recycled into the tournament tree.

Abstract: A method, apparatus, and article of manufacture for a computer implemented rebalancing system. Partitioned data is rebalanced in a database stored on a data storage device connected to a computer. Range values are redefined for each partition. Next, the data is reordered into the redefined ranges for the partitions.

Abstract: A multiprocessing system forms a data structure, such as by loading reorganizing, or recovering, while concurrently collecting various statistics about the data structure. The data structure may comprise tables and/or indices, for example. A first processing unit forms the data structure by assimilating data from one or more data sources into data rows, storing the rows in a buffer, and copying the rows from the buffer to the data structure. Concurrently with the forming step, the same or a second processing unit retrieves the rows from the buffer and applies a predetermined analysis to the rows to formulate statistics regarding the data structure.

Abstract: A method, apparatus, and article of manufacture for a computer implemented recover/build index system. The recover/build index system builds a database index for a database file by scanning partitions of the database file in parallel to retrieve key values and their associated record identifier (rid) values. The recover/build index system then sorts the scanned key/rid values for each partition in parallel. Next, the recover/build index system performs one or more merges on the sorted key/rid values from all of the partitions to generate a single key/rid value stream. Finally, the recover/build index system builds the index using the single key/rid value stream.

Abstract: A system and method for a computer based system having one or more consuming DBMSs and one or more producing DBMSs such that the producing DBMSs produce workfiles for the consuming DBMSs. A producing DBMS uniquely identifies the bufferpool pages comprising a workfile, uniquely identifies the workfile, and flushes only the bufferpool pages corresponding to the workfile to a storage device. The producing DBMS further notifies the consuming DBMS that the workfile is available and receives a reply from the consuming DBMS indicating that the consuming device retrieved the data from the storage device. The consuming device receives notification from the producing DBMS, retrieves the workfile, and replies to the producing DBMS that it has retrieved the workfile.

Abstract: A system and method for a computer system having a plurality of DBMS providing a coordinating and assisting function. If a DBMS performs a coordinating function, it is referred to as a coordinating DBMS. If a DBMS performs an assisting function, it is referred to as an assisting DBMS. Each coordinating DBMS receives a query from a user application, decomposes the query into multiple parallel tasks, and allocates the parallel tasks to all of the DBMSs in the system. Each assisting DBMS receives one or more parallel tasks from a coordinating DBMS, executes the parallel tasks and returns the results to the coordinating DBMS. The coordinating DBMSs and assisting DBMSs access one or more storage devices. Furthermore, the present invention comprises a system and method for dynamically disabling a parallel mode on the coordinating DBMSs and the assisting DBMSs.