Abstract: A system for processing diverse and non-diverse result sets is described. The system includes a client process in a client computer system that constructs a client process execution request identifying a stored procedure and specifying constraints on the quantity of response data that the client process is capable of handling. The client process execution request is transferred from the client process in the client computer system to a server process in a server computer system. The server process invokes the stored procedure identified by the client process execution request. Execution of the stored procedure results in the generation of answer set data for a plurality of diverse query result sets. Result set generators obtain answer set data for X of the query result sets, where X is defined by the constraints. The server process then generates an initial response containing, for each of the X query result sets, an amount of the obtained answer set data consistent with the constraints.

Abstract: A system for processing diverse and non-diverse result sets is described. The system includes a client process in a client computer system that constructs a client process execution request identifying a stored procedure and specifying constraints on the quantity of response data that the client process is capable of handling. The client process execution request is transferred from the client process in the client computer system to a server process in a server computer system. The server process invokes the stored procedure identified by the client process execution request. Execution of the stored procedure results in the generation of answer set data for a plurality of diverse query result sets. Result set generators obtain answer set data for X of the query result sets, where X is defined by the constraints. The server process then generates an initial response containing, for each of the X query result sets, an amount of the obtained answer set data consistent with the constraints.

Abstract: The invention establishes the context in which data exchanged between dissimilar relational database management systems can be mutually understood and preserved, and data conversions can be minimized. The invention accomplishes this by establishing layers of descriptive information which isolate machine characteristics, levels of support software, and user data descriptions. Optimized processing is achieved by processing the different descriptor levels at different times during the development and execution of the database management systems. Minimal descriptive information is exchanged between the cooperating database management systems. Any data conversions that may be necessary are done only by the receiver of the data, and only at the point where it is necessary to have the data represented in the receiver's native format for processing.

Abstract: The invention provides transaction synchronization in the form of COMMIT processing in a distributed, heterogeneous database system wherein some resources are synchronized to a transaction by a single-phase commit procedures while other resources synchronize by multi-phase commit procedures. The invention invests an application requestor at an application site with authority to represent all single-phase commit resources in multi-phase commit processing.

Abstract: The invention establishes the context in which data exchanged between dissimilar relational database management systems can be mutually understood and preserved, and data conversions can be minimized. The invention accomplishes this by establishing layers of descriptive information which isolate machine characteristics, levels of support software, and user data descriptions. Optimized processing is achieved by processing the different descriptor levels at different times during the development and execution of the database management systems. Minimal descriptive information is exchanged between the cooperating database management systems. Any data conversions that may be necessary are done only by the receiver of the data, and only at the point where it is necessary to have the data represented in the receiver's native format for processing.

Abstract: The invention establishes the context in which data exchanged between dissimilar relational database management systems can be mutually understood and preserved. The invention accomplishes this by establishing layers of descriptive information which isolate machine characteristics, levels of support software, and user data descriptions. Optimized processing is achieved by processing the different descriptor levels at different times during the development and execution of the database management systems. Minimal descriptive information is exchanged between the cooperating database management systems. For systems which match, data conversion is completely avoided. For systems which do not match, data conversion is minimized.

Abstract: Application programs which are developed and scheduled within a first computing system environment are permitted to access relational data registered at a remote database management system (DBMS) operating in a second computing environment dissimilar to the first computing environment. Access to data through the DBMS from an application execution site remote from the DBMS is supported by a process, logically subordinate to the application program which maps application program data access requests to the DBMS.

Abstract: A method for more accurately estimating the time required to process a data base query using a selected index. A selected number of the most frequently occurring index key values (38) are collected during an index sequential scan. These most frequency occurring values are stored as percentage frequencies of occurrence in the data base system's catalog (42). Estimated access and processing times (NPAR, NPAS, NCPU) for a given query are calculated based on the stored frequencies where possible. Where the query's search criteria specify values other than the stored most frequently occurring values, those values are assumed to be uniformly distributed.

Abstract: A restartable load without logging method permits the restart of a LOAD operation from the last COMMIT point without requiring the writing of images of loaded records to the log. Instead, the method logs only a minimal amount of information, recording positions within the data sets to be loaded and within the tablespace being loaded.