Efficient radix sorting system employing a dynamic branch table

Details Efficient radix sorting system employing a dynamic branch table Efficient radix sorting system employing a dynamic branch table

1991-12-23

1995-03-07

Black, Thomas G.

Boots, shoes, and leggings

395700, 395650, 395800, 395200, 3642229, 3649623, 364DIG1, G05F 708

Patent

active

053966228

ABSTRACT:
In a recursive distributive sort of records according to their key fields, a method for distributing keys to form one or more subgroups and collecting them to preserve or maintain an order among the subgroups. The distribution is accomplished by comparing each key field against an extrinsic attribute and then assigning the key to a subgroup or bucket. The collection sequence preserves the overall key field order. A Dynamic Branching Table (DBT) for governing the ordering of buckets during the collection phase is initially populated with NO-OP instructions. During the distribution phase, a CALL instruction replaces the NO-OP in the sorted order DBT position upon the first occurrence of a distinguishable character in the key character sequence being scanned. An address pointer, pointing to the corresponding bucket, is then inserted in a Bucket Pointer Table (BPT) indexed to the DBT. During the collection phase, the DBT is executed and the empty buckets are skipped by NO-OP execution, while the populated buckets are processed by subroutine CALL execution.

REFERENCES:
patent: 4575798 (1986-03-01), Lindstrom et al.
patent: 5142687 (1992-08-01), Lary
patent: 5175857 (1992-12-01), Inoue
patent: 5206947 (1993-04-01), Edem et al.
patent: 5218700 (1993-06-01), Allenbeechick
patent: 5237678 (1993-08-01), Kuechler et al.
Robert Sedgewick, Algorithms, Addison-Wesley Publishing Co (Reading, 1983) pp. 115-124.
Donald E. Knuth, The Art of Computer Programming vol. 3: Sorting & Searching, Addison Wesley (Reading, Mass., 1973) pp. 78-79.

Affiliated with

Also associated with

Rating

Efficient radix sorting system employing a dynamic branch table does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficient radix sorting system employing a dynamic branch table, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient radix sorting system employing a dynamic branch table will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1413719