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: Provided are techniques for generating a result set. A statement that includes at least one statement pattern is received, wherein each statement pattern is a template that indicates how a statement is to be modified for execution against a data store and wherein each statement pattern modifies program logic and control flow. Each statement pattern is expanded to generate one or more new statements, wherein each statement pattern is capable of being expanded to zero or more statement patterns. The one or more new statements are executed against a data store to obtain a result set. It is determined whether to modify the result set based on the at least one statement pattern. In response to determining that the result set is to be modified, modifying the result set.

Abstract: Provided are a system and program for accessing data in a distributed database environment. A client program receives multiple requests for data from a database object satisfying specified search predicates from an application program. Each request includes a request for at least one row from the table. The client program transfers a database command and a rowset parameter indicating a maximum number of rows to return to a server program over a network if the requested row is not maintained by the client program. A data block is generated with the server program including rows from the database object satisfying the search predicates in response to the database command. The rows included in the data block do not exceed the rowset parameter. The server program transfers the data block to the client program. In turn, the client program returns at least one requested row from the received data block in response to one request for the at least one row of data from the application program.

Abstract: An apparatus and a method of clearing a runtime data area where software objects store variables and each software object has a finalize method where the invention drives the finalize method of a software object when the finalize method of the software object has not performed an operation for a predetermined time period.

Abstract: A shared memory device called the Coupling Facility (CF) is used to record the indoubt transaction entries for each member of the database cluster, avoiding the CPU cost and elapsed time impact of persisting this information to disk (either via a log write or a relational table I/O). The CF provides full read/write access and data coherency for concurrent access by all the members in the database cluster. At any given point in time, the CF will contain the full list of indoubt transactions for the entire database cluster. CF duplexing is used to guarantee the integrity of the CF structure used for the indoubt list. In the event of complete loss of both CF structures (which will not happen except in major disaster situations), data sharing group restart processing can reconstruct the CF structures from the individual member logs.

Abstract: An SQL procedure deployment system deploys a query procedure comprising a procedural logic component and a database request component from a source system to a target system. At generation of the query procedure, the system generates a query procedure source code, a symbol table, and an encapsulated optimization results to regenerate run-time instructions for query statements of the database request component and make the query statements function with a deployed procedural logic component. The system maintains an association between the procedural logic component and the database request component during deployment. The system copies an internal representation of the procedural logic component to the target system without regeneration. The system regenerates the database request component to recreate the query procedure on the target system and to maintain a consistent interface between the procedural logic component and database request component.

Abstract: A system, computer usable medium and computer-based method for supporting named memory variables in an information retrieval system including a relational database. PUBLIC and PRIVATE named memory variables can be created, referenced, modified or deleted using SQL statements. The information retrieval system allocates a memory area as a named variable storage space for storing named memory variables. System catalogs may be used for storing information about PUBLIC, SECURE PUBLIC, PRIVATE, SECURE PRIVATE and pre-defined named memory variables. PUBLIC and PRIVATE named memory variables can be used for transferring information between SQL statements of one or more sessions or for retrieving system information from the relational database. Both PUBLIC and PRIVATE types can be defined as SECURE named memory variables requiring specific authorization privileges to read or write to the variable.

Abstract: A data server of a data processing system is operably coupled to a database and in communication with a middleware server. A connection between the data server and the middleware server is established and managed. A set of attributes identifying trusted middleware servers is instituted with the data server. The middleware server transmits a connection request to the data server. The connection request has request attributes including identifying the connection request as being for a new connection or reuse of an existing connection with different connection request attributes. A connection with the middleware server is established by the data server based on the connection request. A connection status message is received by the middleware server from the data server indicating a status of the connection request. A trust indicator for the connection is established at the data server according to a trust status identified by the set of attributes for the middleware server.

Abstract: A method, apparatus and program storage device readable by a computer tangibly embodying a program of instructions executable by the computer is provided for reorganization of database data. The computer database reorganization method reorganizes one set of database data blocks at a time, allowing concurrent data manipulation. Method identifies a set of data blocks for reorganization in a sliding peephole mode, re-orders the set of data blocks and replaces the original set of data blocks with the re-ordered set of data blocks. The method include an overlapping peephole method, which chooses, for each set of data block to be reorganized, a next succeeding set of data blocks plus an overlap segment, wherein the overlap segment includes a set of empty pages other than intentionally specified free pages, and the overlap segment is a subset of the preceding set of data blocks.

Abstract: Techniques are provided for supporting versions of a routine. A first version of the routine is created. A second version of the routine is generated in response to receiving an alter statement including an add version clause. The second version of the routine is activated in response to receiving an alter statement including an activate version clause.

Abstract: Provided are a system and program for accessing data in a distributed database environment. A client program receives multiple requests for data from a database object satisfying specified search predicates from an application program. Each request includes a request for at least one row from the table. The client program transfers a database command and a rowset parameter indicating a maximum number of rows to return to a server program over a network if the requested row is not maintained by the client program. A data block is generated with the server program including rows from the database object satisfying the search predicates in response to the database command. The rows included in the data block do not exceed the rowset parameter. The server program transfers the data block to the client program. In turn, the client program returns at least one requested row from the received data block in response to one request for the at least one row of data from the application program.

Abstract: Provided is a method for accessing data in a distributed database environment. A client program receives multiple requests for data from a database object satisfying specified search predicates from an application program. Each request includes a request for at least one row from the table. The client program transfers a database command and a rowset parameter indicating a maximum number of rows to return to a server program over a network if the requested row is not maintained by the client program. A data block is generated with the server program including rows from the database object satisfying the search predicates in response to the database command. The rows included in the data block do not exceed the rowset parameter. The server program transfers the data block to the client program. In turn, the client program returns at least one requested row from the received data block in response to one request for the at least one row of data from the application program.

Abstract: A computer program product is provided as a system and associated method to provide a robust, fail-safe, fast environment for running non-native language routine programs, such that when the program fails or terminates, the virtual machine can be restarted without terminating the operating system process. The system dynamically creates a number of independent virtual machines to run non-native language routines. Each virtual machine is created in a process external to the database engine, in a refreshable native runtime environment inside the process or address space. If the virtual machine should terminate with an uncaught exception or error or if it becomes unusable for executing other non-native language routines, the system recognizes that condition and terminates the native runtime environment without terminating the process.

Abstract: Provided are techniques for generating a result set. A statement that includes at least one statement pattern is received, wherein each statement pattern is a template that indicates how a statement is to be modified for execution against a data store and wherein each statement pattern modifies program logic and control flow. Each statement pattern is expanded to generate one or more new statements, wherein each statement pattern is capable of being expanded to zero or more statement patterns. The one or more new statements are executed against a data store to obtain a result set. It is determined whether to modify the result set based on the at least one statement pattern. In response to determining that the result set is to be modified, modifying the result set.

Abstract: A shared memory device called the Coupling Facility (CF) is used to record the indoubt transaction entries for each member of the database cluster, avoiding the CPU cost and elapsed time impact of persisting this information to disk (either via a log write or a relational table I/O). The CF provides full read/write access and data coherency for concurrent access by all the members in the database cluster. At any given point in time, the CF will contain the full list of indoubt transactions for the entire database cluster. CF duplexing is used to guarantee the integrity of the CF structure used for the indoubt list. In the event of complete loss of both CF structures (which will not happen except in major disaster situations), data sharing group restart processing can reconstruct the CF structures from the individual member logs.

Abstract: Aspects for dynamically changing attributes in an embedded-SQL application are described. In these aspects, an option is provided within a standard SQL statement for specifying one or more attributes of at least a declared cursor. The standard SQL statement is then processed to include the specified one or more attributes in at least the declared cursor. The provision occurs with an ATTRIBUTES option and within a PREPARE SQL statement.

Abstract: Provided is a method, system, and program for accessing data in a distributed database environment. A client program receives multiple requests for data from a database object satisfying specified search predicates from an application program. Each request includes a request for at least one row from the table. The client program transfers a database command and a rowset parameter indicating a maximum number of rows to return to a server program over a network if the requested row is not maintained by the client program. A data block is generated with the server program including rows from the database object satisfying the search predicates in response to the database command. The rows included in the data block do not exceed the rowset parameter. The server program transfers the data block to the client program. In turn, the client program returns at least one requested row from the received data block in response to one request for the at least one row of data from the application program.

Abstract: Using a database management system's own infrastructure to invoke a stored procedure for creating and preparing a database application. The stored procedure automates the pre-compile, compile, linker, and binder steps performed in creating and preparing the database application. The stored procedure is invoked to perform these steps in order to render the database application executable by the RDBMS. In conjunction with the invocation of the stored procedure, input parameters for the stored procedure may be specified including the requested function, the name of the database application, the source code for the database application, pre-compiler options, compiler options, linker options, binder options, and runtime options. The outputs from the stored procedure may include an executable load module, a database resource module, an output parameter string indicating the success or failure of each step, and one or more result sets containing the outputs of each step.

Abstract: An apparatus and a method of clearing a runtime data area where a plurality of software objects store a variable in the runtime data area and each of the plurality of software objects has a finalize method where the invention drives the finalize method of one of the plurality of software objects, clears the runtime area where the one of plurality of software objects variable was stored when the driven finalize method ends, and drives the finalize method of another of the plurality of software objects when the finalize method of the one of the plurality of software objects has not performed an operation for a predetermined time period.

Abstract: Disclosed is a method, system, and program for accessing performance data. A call from an application program including database program statements, such as SQL statements, executing on a thread is processed. This call is used to access performance data for at least one database program statement executing on the thread. The thread further processes the accessed performance data returned in response to the call.