Stable sorting for a sort accelerator

Details Stable sorting for a sort accelerator Stable sorting for a sort accelerator

1989-06-30

1993-04-27

Kulik, Paul V.

Boots, shoes, and leggings

395800, 364DIG1, 3642229, G06F 708

Patent

active

052069478

ABSTRACT:
A stable sorting system and method for use with a sort accelerator having a rebound sorter as a merger is disclosed. The stable sorting system maintains an output order of records which have equal keys. This output order is the same order of those records as they entered the rebound sorter. Stable sorting is maintained in both the sorting and the merging operations of the sort accelerator. An additional byte is inserted between the key and the data of a record to preserve record order for records having equal keys.

REFERENCES:
patent: 3713107 (1973-01-01), Barsamian
patent: 3997880 (1976-12-01), Chen et al.
patent: 4031520 (1977-06-01), Rohner
patent: 4064556 (1977-12-01), Edelberg et al.
patent: 4078260 (1978-03-01), Chen et al.
patent: 4090249 (1978-05-01), Chen
patent: 4464732 (1984-08-01), Clark
patent: 4520456 (1985-05-01), Miranker et al.
patent: 4809158 (1989-02-01), McCauley
patent: 5111465 (1992-05-01), Edem et al.
patent: 5142687 (1992-08-01), Lary
Niklaus Wirth, Algorithms & Data Structures=Programs, Prentice-Hall, Inc., 1976, pp. 56-59.
S. Todd, "Algorithm and Hardware for a Merge Sort Using Multiple Processors," IBM J. Res. Develop., vol. 22, No. 5, Sep. 1978, pp. 509-517.
"The Rebound Sorter: An efficient sort engine for large files", International Conference on Databases, 4th-Proceedings. West Berlin, Germany, 1978, pp. 312-318. IEEE Computer Society, Long Beach, California. Document #78 CH 1389-6 C.

Affiliated with

Also associated with

Rating

Stable sorting for a sort accelerator does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Stable sorting for a sort accelerator, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Stable sorting for a sort accelerator will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2334255