Abstract: A condition handling method and means capable of handling programs written in a plurality computer programming languages is created by a set of routines which implement the Common Condition Handling (CCH) function. These routines have entry points which are declared as external or entry variables which enables application programs to link to them. The compilers and application programs can then interact with the condition handling process by calling or branching to the entry points in the common condition handling code when the program is executing. Language specific condition handling routines and user condition handlers are invoked using a last-in-first-out (LIFO) queue to associate the handlers with the current stack frame. Any handler may respond to the CCH with one of three types of requests: Resume, Percolate, and Promote. A separate means is provided for registering Exit Handlers and to move the resume cursor.

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 present invention provides a system and method for retrieving data from a computerized database system. Prior to execution of a query statement, the system determines an optimal sequential execution plan for the query statement. The optimal sequential execution plan is used to determine an optimal parallel execution plan. During the execution of the query, run time variables are used to determine whether to use the sequential execution plan without modification or a modification of the parallel execution plan.

Abstract: In a computer database system, a method and system are provided for interactively and iteratively constructing a query using a table metaphor displayed on a user display. Alterations are made directly to the table metaphor by the database user. The alterations relate to adding, deleting, or combining columns of attributes and limiting ranges of attribute values. The alterations are registered and the table metaphor updated to reflect the registered alterations. The table metaphor can be repeatedly used to further register additional alterations. The query corresponding to the table metaphor in its final form is run against the full database to generate a report in the format indicated by the table metaphor.

Abstract: In a computer database system, a method and system are provided for interactively and iteratively constructing a query using a table metaphor displayed on a user display. Alterations are made directly to the table metaphor by the database user. The alterations relate to adding, deleting, or combining columns of attributes and limiting ranges of attribute values. The alterations are registered and the table metaphor updated to reflect the registered alterations. The table metaphor can be repeatedly used to further register additional alterations. The query corresponding to the table metaphor in its final form is run against the full database to generate a report in the format indicated by the table metaphor.

Abstract: A method and system for dynamically scheduling the building of computer programs from source code parts which may have dependencies which require that some parts be compiled before others. A list of source code parts and dependencies is dynamically created as compilation of the parts is attempted. The build status for each part is tracked. The list is repeatedly processed until none of the build status fields changes during an entire pass through the list. The source code parts which cannot be compiled and integrated in the build for reasons such as circular compilation dependencies or references to non-existing, prerequisite source code parts will be identified by this process.