International Business Machines Corporation

Lee C Chu

Joshua R Tiefenbach

David Tremaine

Leo T M Lau

Michael T Ho

Embodiments of the present invention provide a method, computer program product and system for increasing sorting efficiency by utilizing a determined crossover point. Initially, a set of data, containing a number of tuples, to be sorted is received. A determination is made as to the number of radix sort iterations to perform based on the number of tuples of the received data. A countdown timer is set based on the determined number of radix sort iterations. Radix sorts iterations are performed recursively. After each iteration, the countdown timer is decreased. Upon the countdown timer reaching zero, one or more comparison sorts is performed on the remainder of the set of data not sorted by the radix sorting.

Increasing radix sorting efficiency utilizing a crossover point

In one implementation, a method for sustaining database processing parallelism of one or more parallelized processes to build one or more index pages using pseudo record identifiers (PRIDs) is disclosed. The method comprises generating one or more PRIDs for one or more respective internal record formats (IRFs), inserting said generated PRIDs into a respective index key, generating a relational index of the PRID and a predetermined record identifier (RID) respectively determined in relation to said IRF, and building one or more index pages in relation to the relational index by comparing said RID and said PRID for their respective IRF in said relational index, and determining which one of said RID or said PRID to insert into said index page.

Growing community of inventors

Toronto, Canada

Lee C Chu