Abstract: Systems and methods are provided for reorganizing a partition-by-growth database with LOB columns. An example method includes creating a partition assignment table by performing a logical reorganization of the partition-by-growth database, wherein an assignment of at least one base table row and its corresponding LOB in the partition assignment table differs from a current assignment of the at least one base table row. The method also includes performing a base table reorganization based on the partition assignment table in parallel with a LOB auxiliary table reorganization based on the partition assignment table and a LOB dataset assignment table. The method may also include applying changes to the reorganized base tables and the reorganized LOB auxiliary tables using the partition assignment table.

Abstract: Technologies are described for a system and method for reorganizing a tablespace in a database such that rows of the tablespace are arranged in a sequence defined in a balanced tree-type clustering index of the tablespace. The method includes sectioning the clustering index and the tablespace into sections including logically distinct sets of data by reading only tree pages of the clustering index to determine logical divisions. The method further includes allocating an amount of output space on a storage device for each section of the tablespace and of the clustering index, to provide for each section a first range of storage space for an output clustering index for the section, and a second range of storage space for an output tablespace for the section. The method further includes scheduling a reorg task for each section, and executing, by at least one processor, the scheduled reorg tasks on the sections.

Abstract: Technologies are described for a system and method for reorganizing a tablespace in a database such that rows of the tablespace are arranged in a sequence defined in a balanced tree-type clustering index of the tablespace. The method includes sectioning the clustering index and the tablespace into sections including logically distinct sets of data by reading only tree pages of the clustering index to determine logical divisions. The method further includes allocating an amount of output space on a storage device for each section of the tablespace and of the clustering index, to provide for each section a first range of storage space for an output clustering index for the section, and a second range of storage space for an output tablespace for the section. The method further includes scheduling a reorg task for each section, and executing, by at least one processor, the scheduled reorg tasks on the sections.

Abstract: Technologies are described for a system and method for reorganizing a tablespace in a database such that rows of the tablespace are arranged in a sequence defined in a balanced tree-type clustering index of the tablespace. The method includes sectioning the clustering index and the tablespace into sections including logically distinct sets of data by reading only tree pages of the clustering index to determine logical divisions. The method further includes allocating an amount of output space on a storage device for each section of the tablespace and of the clustering index, to provide for each section a first range of storage space for an output clustering index for the section, and a second range of storage space for an output tablespace for the section. The method further includes scheduling a reorg task for each section, and executing, by at least one processor, the scheduled reorg tasks on the sections.

Abstract: Systems and methods are provided for reorganizing a partition-by-growth database with LOB columns. An example method includes creating a partition assignment table by performing a logical reorganization of the partition-by-growth database, wherein an assignment of at least one base table row and its corresponding LOB in the partition assignment table differs from a current assignment of the at least one base table row. The method also includes performing a base table reorganization based on the partition assignment table in parallel with a LOB auxiliary table reorganization based on the partition assignment table and a LOB dataset assignment table. The method may also include applying changes to the reorganized base tables and the reorganized LOB auxiliary tables using the partition assignment table.

Abstract: Systems and methods are provided for reorganizing a partition-by-growth database with LOB columns. An example method includes creating a partition assignment table by performing a logical reorganization of the partition-by-growth database, wherein an assignment of at least one base table row and its corresponding LOB in the partition assignment table differs from a current assignment of the at least one base table row. The method also includes performing a base table reorganization based on the partition assignment table in parallel with a LOB auxiliary table reorganization based on the partition assignment table and a LOB dataset assignment table. The method may also include applying changes to the reorganized base tables and the reorganized LOB auxiliary tables using the partition assignment table.

Abstract: Systems and methods are provided for reorganizing a partition-by-growth database with LOB columns. An example method includes creating a partition assignment table by performing a logical reorganization of the partition-by-growth database, wherein an assignment of at least one base table row and its corresponding LOB in the partition assignment table differs from a current assignment of the at least one base table row. The method also includes performing a base table reorganization based on the partition assignment table in parallel with a LOB auxiliary table reorganization based on the partition assignment table and a LOB dataset assignment table. The method may also include applying changes to the reorganized base tables and the reorganized LOB auxiliary tables using the partition assignment table.

Abstract: An athletic shooting aid adapted to be detachably mounted directly on the goal of a sporting event to provide a target at which the player aims and strikes with the game piece in order to improve the form and accuracy of the player's shooting. The device comprises a clamp which is removably attachable to the goal having a substantially straight elongated member extending from the clamp with a ball or target of material attached to the elongated member to serve as the target at which the player aims when shooting the game piece. The elongated member is adapted and configured to allow the ball to move when struck by the game piece in such a manner that the game piece deflects the ball without substantially affecting the trajectory of the game piece and to allow the ball to be repositioned after the game piece has passed through the goal.

Abstract: An athletic shooting aid adapted to be detachably mounted directly on the goal of a sporting event to provide a target at which the player aims and strikes with the game piece in order to improve the form and accuracy of the player's shooting. The device comprises a clamp which is removably attachable to the goal having a substantially straight elongated member extending from the clamp with a ball or target of material attached to the elongated member to serve as the target at which the player aims when shooting the game piece. The elongated member is adapted and configured to allow the ball to move when struck by the game piece in such a manner that the game piece deflects the ball without substantially affecting the trajectory of the game piece and to allow the ball to be repositioned after the game piece has passed through the goal.

Abstract: An athletic shooting aid adapted to be detachably mounted directly on the goal of a sporting event to provide a target at which the player aims and strikes with the game piece in order to improve the form and accuracy of the player's shooting. The device comprises a clamp which is removably attachable to the goal having a substantially straight elongated member extending from the clamp with a ball or target of material attached to the elongated member to serve as the target at which the player aims when shooting the game piece. The elongated member is adapted and configured to allow the ball to move when struck by the game piece in such a manner that the game piece deflects the ball without substantially affecting the trajectory of the game piece and to allow the ball to be repositioned after the game piece has passed through the goal.

Abstract: An improved method to dramatically reduce the time required to reorganize DB2 tablespaces and index files by not utilizing conventional sort techniques. Viewing access is allowed during the reorganization process by setting the files to read only status. The process is basically non-destructive, allowing a prompt return to the original state, and is checkpointed, allowing restarting at selected intervals. Briefly, the original table and indices are considered as A files and read into memory. New row IDs or RIDs are developed using a non-sorting technique so that the proper order of the data is developed. After the new RIDs have been developed, both the clustering index and the row data are read out of memory and written to a new table and clustering index files in the proper order as B files. All of the table files are then stopped to allow exclusive access. Next, a series of AMS statements are built to do the renaming operations.

Abstract: An athletic shooting aid adapted to be detachably mounted directly on the goal of a sporting event to provide a target at which the player aims and strikes with the game piece in order to improve the form and accuracy of the player's shooting. The device comprises a clamp which is removably attachable to the goal having a substantially straight elongated member extending from the clamp with a ball or bulk of material attached to the elongated member to serve as the target at which the player aims when shooting the game piece. The elongated member is adapted and configured to allow the ball to move when struck by the game piece in such a manner that the game piece deflects the ball without substantially affecting the trajectory of the game piece and to allow the ball to be repositioned after the game piece has passed through the goal.

Abstract: An improved method to dramatically reduce the time required to reorganize DB2 tablespaces and index files by not utilizing conventional sort techniques. Viewing access is allowed during the reorganization process by setting the files to read only status. The process is basically non-destructive, allowing a prompt return to the original state, and is checkpointed, allowing restarting at selected intervals. Briefly, the original table and indices are considered as A files and read into memory. New row IDs or RIDs are developed using a non-sorting technique so that the proper order of the data is developed. After the new RIDs have been developed, both the clustering index and the row data are read out of memory and written to a new table and clustering index files in the proper order as B files. All of the table files are then stopped to allow exclusive access. Next, a series of AMS statements are built to do the renaming operations.

Abstract: An improved method to dramatically reduce the time required to reorganize DB2 tablespaces and index files by not utilizing conventional sort techniques. Viewing access is allowed during the reorganization process by setting the files to read only status. The process is basically non-destructive, allowing a prompt return to the original state, and is checkpointed, allowing restarting at selected intervals. Briefly, the original table and indices are considered as A files and read into memory. New row IDs or RIDs are developed using a non-sorting technique so that the proper order of the data is developed. After the new RIDs have been developed, both the clustering index and the row data are read out of memory and written to a new table and clustering index files in the proper order as B files. Then any remaining non-clustering indices are reorganized using non-sorting techniques in a similar fashion.

Abstract: A method for reorganizing database index files without performing a conventional sort operation. The index file uses a balanced tree structure, with the logical order of the entries in each page being maintained by the database program. In the reorganizing method the logical order of the leaf pages is determined. A logical order buffer is developed which correlates the logical order to the physical order. This buffer is transposed to a physical order to logical order buffer. A large buffer is set aside in memory and the index file is read sequentially. As each physical page is read, it is placed in its logical position in the large memory buffer. When the large buffer is filled, the pages are sequentially written to a new index file, with the various tree pages being developed in the fly. When the writing operation is completed, the old index file is removed and the new, ordered index file is used.