Computer with two-dimensional merge tournament sort using offset

Details Computer with two-dimensional merge tournament sort using offset Computer with two-dimensional merge tournament sort using offset

1994-09-19

1996-01-23

Kulik, Paul V.

Boots, shoes, and leggings

364DIG1, 36422281, 3642229, G06F 724

Patent

active

054871662

ABSTRACT:
To perform a sort of N records, a two-dimensional tree structure is formed with a tree of subtrees, where each subtree is formed by a plurality of nodes organized in a binary tree. For each leaf node in the tree, there is an ancestor chain of nodes (from child to parent, from parent to grand-parent, from grand-parent to great-grand-parent, . . . and so on) that connects each leaf node to the root node. To perform the sort, the processing unit stores codes representing keys into nodes in the two-dimensional tree and performs a tree sort of the keys using the codes. The codes are accessed in the subtrees and processed to determine the sort order of the keys and therefore the sort order of the corresponding records.

REFERENCES:
patent: 5210870 (1993-05-01), Baum et al.
patent: 5287494 (1994-02-01), Garcia et al.
patent: 5355478 (1994-10-01), Brady et al.
Donald E. Knuth, "The Art of Computer Programming: vol. 3/Sorting and Searching," 1973, pp. 209-218; 471-473.

Affiliated with

Also associated with

Rating

Computer with two-dimensional merge tournament sort using offset does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Computer with two-dimensional merge tournament sort using offset, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computer with two-dimensional merge tournament sort using offset will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1511001