Abstract: An apparatus, article of manufacture and computer-based method is provided for determining the optimum join sequence for processing a query having a plurality of tables from a relational database stored in an electronic storage device having a database management system. The method is performed in two passes. The first pass is used for determining an optimum join sequence for joining the plurality of tables from the query. The second pass uses the optimum join sequence for creating a lowest cost access path plan for processing the query. The first pass performs successive steps until creation of a simulated composite table having all tables from the query, wherein each step creates a set of miniplans for simulating all possible joins of a predetermined subset of the query tables and uses a cost model calculations for estimating and saving the least expensive join from this set of joins.

Abstract: Provided are a method, system, and program for selecting a join order for tables subject to a join operation. An estimation is made of a join cost to perform joins on permutations of at least two of the tables, wherein each join permutation indicates an order of joining the tables. A determination is made as to whether sufficient computational resources are available to perform a join cost analysis of further join permutations of the tables. If sufficient computational resources are not available, then a determination is made of a restricted subset of remaining join permutations of at least two of the tables for which join costs have not been estimated that is less than all the remaining join permutations. The join costs of permutations of tables in the restricted subset is estimated and the estimated join costs are used to select one join permutation of all the tables having a lowest estimated join cost.

Abstract: Provided are a method, system, and program for selecting a join order for tables subject to a join operation. An estimation is made of a join cost to perform joins on permutations of at least two of the tables, wherein each join permutation indicates an order of joining the tables. A determination is made as to whether sufficient computational resources are available to perform a join cost analysis of further join permutations of the tables. If sufficient computational resources are not available, then a determination is made of a restricted subset of remaining join permutations of at least two of the tables for which join costs have not been estimated that is less than all the remaining join permutations. The join costs of permutations of tables in the restricted subset is estimated and the estimated join costs are used to select one join permutation of all the tables having a lowest estimated join cost.

Abstract: An apparatus, article of manufacture and computer-based method is provided for determining the optimum join sequence for processing a query having a plurality of tables from a relational database stored in an electronic storage device having a database management system. The method is performed in two passes. The first pass is used for determining an optimum join sequence for joining the plurality of tables from the query. The second pass uses the optimum join sequence for creating a lowest cost access path plan for processing the query. The first pass performs successive steps until creation of a simulated composite table having all tables from the query, wherein each step creates a set of miniplans for simulating all possible joins of a predetermined subset of the query tables and uses a cost model calculations for estimating and saving the least expensive join from this set of joins.

Abstract: A system is provided for generating transition effects for use on a visual display. The system includes a binary table for describing a transition effect and a method for ordering the rows in the table to produce the transition. The table includes an arbitrary number of rows, each row representing a cell (group of picture elements) on the display. A numerical value, based on any function of cell location, is associated with each cell. The table is then sorted according to the numerical values. Each row in the sorted table drives a step in the transition effect. The cells described by the various rows are changed in sorted order to display the material from the image being transitioned-to. The sequence of processing of the rows causes the desired transition effect. By varying the function used to order the rows, an infinite variety of transition effects can be created.

Abstract: A computer system generates transition effects for use on a visual display. The system includes a binary table for describing a transition effect and a method for ordering the rows in the table to produce the transition. The table includes an arbitrary number of rows, each row representing a cell (group of picture elements) on the display. A numerical value, based on any function of cell location, is associated with each cell. The table is then sorted according to the numerical values. Each row in the sorted table drives a step in the transition effect. The cells described by the various rows are changed in sorted order to display the material from the image being transitioned-to. The sequence of processing of the rows causes the desired transition effect. By varying the function used to order the rows, an infinite variety of transition effects can be created.