US4510567A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Qualifying and sorting file record data
Assignee: International Business Machines Corp
•
Filing: 1981-05-18
•
Granted: 1985-04-09
•
Expires: 2001-05-18
Abstract
Abstract Record data on a disk file is sorted in a text/data processor by means of an algorithm that transfers such records on the basis of rank to a sort buffer on the basis of qualifying criteria. Each qualified file record is compared with the lowest ranked record previously transferred and located in the sort buffer. When a higher ranked record is identified it is transferred into the buffer at a location based on qualification. Lower ranked records are deleted from the sort buffer if space does not permit the storing of such records within the space available. When the sort buffer has been loaded with the highest ranked records remaining in the disk file without overflowing the buffer is unloaded to an output device. The sort program recycles through a subsequent pass again transferring the highest ranked remaining records into the sort buffer. To minimize recycle time, a presort algorithm is run to set record identifying bits in a bit map section of the sort buffer. Each time the contents of the sort buffer is output the record identifying bits for the records in the sort buffer are reset to a second state. The second state of a record identifying bit indicates that that record will not be considered for future passes through the sort routine.
Inventors
- 👤 Philip Y. Chang
- 👤 John W. McInroy
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 19:21
CPC Classifications
G; G06; G06F; G06F40/00; G06F40/10; G06F40/12; G06F40/123; G06F40/151; G06F40/166; G06F7/00; G06F7/22; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99937
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
266 words
A method of qualifying and sorting file records from a mass storage means into a sort buffer memory for use in an office processing environment whereby the sort buffer memory provides a temporary retention of the file records in an order based on a selected ranking, comprising the steps of: (a) accessing each of said file records in said mass storage means; (b) evaluating an accessed file record in accordance with a chosen sort algorithm to determine if it qualifies for transfer to the sort buffer memory; (c) if the accessed file record qualifies, then comparing a rank of the qualified file record in the mass storage means with the rank of a lowest ranked file record in the sort buffer memory; (d) if the rank of the qualified file record is higher than the rank of the lowest ranked file record in the sort buffer memory, then the qualified file record is transferred to unused space in the sort buffer memory; and if the rank of the qualified record is lower than the rank of the lowest ranked file record, then the qualified file record is not transferred to the sort buffer memory if the buffer is full; (e) placing the qualified file record transferred to the sort buffer memory at a level based on the rank determined by the chosen sorting algorithm; (f) repeating steps (c)--(e) for each qualified file record in the storage means until the sort buffer has been loaded with the highest ranked records in the storage means without overflowing; and (g) outputting said highest ranked records from said sort buffer.
Claim 2
Independent Claim
266 words
A method of qualifying and sorting file records from a mass storage means into a sort buffer memory for use in an office processing environment whereby the sort buffer memory provides a temporary retention of the file records in an order based on a selected ranking, comprising the steps of: (a) accessing each of said file records in said mass storage means; (b) evaluating an accessed file record in accordance with a chosen sort algorithm to determine if it qualifies for transfer to the sort buffer memory; (c) if the accessed file record qualifies, then comparing a rank of the qualified file record in the mass storage means with the rank of a lowest ranked file record in the sort buffer memory; (d) if the rank of the qualified file record is higher than the rank of the lowest ranked file record in the sort buffer memory, then the qualified file record is transferred to unused space in the sort buffer memory; and if the rank of the qualified record is lower than the rank of the lowest ranked file record, then the qualified file record is not transferred to the sort buffer memory if the buffer is full; (e) placing the qualified file record transferred to the sort buffer memory at a level based on the rank determined by the chosen sorting algorithm; (f) repeating steps (c)--(e) for each qualified file record in the storage means until the sort buffer has been loaded with the highest ranked records in the storage means without overflowing; and (g) outputting said highest ranked records from said sort buffer.
Claim 3
Dependent Claim
38 words
A method of qualifying and sorting file records as set forth in claim 1 wherein the step of evaluating an accessed file record to determine if it qualifies for transfer includes evaluating multiple fields of each file record.
Claim 4
Dependent Claim
31 words
A method of qualifying and sorting file records as set forth in claim 1 including the step of repeating steps (c)-(g) for the remaining qualified file records in the storage means.
Claim 5
Dependent Claim
28 words
A method of qualifying and sorting file records as set forth in claim 3 wherein the file records in the sort buffer are transferred to a disk storage.
Claim 6
Independent Claim
191 words
A method of qualifying and sorting file records in a storage means into a sort buffer for temporary retention in an order based on a selected ranking, comprising th steps of: (a) accessing each of said file records in said storage means; (b) evaluating an accessed file record to determine if it qualifies for transfer to the sort buffer; (c) if said accessed file record qualifies, comparing a rank of the qualified file record in the storage means with the rank of a lowest ranked file record in the sort buffer; (d) if the rank of the qualified file record is higher than the rank of the lowest ranked file record, transferring the qualified file record in the storage means to the sort buffer; (e) deleting the lowest ranked file record from the sort buffer to facilitate storage of the qualified file record therein; (f) locating the qualified file record transferred to the sort buffer at a level based on the rank thereof; and (g) repeating steps (c)-(f) for each qualified file record in the storage means until the sort buffer has been loaded with the highest ranked records without overflowing.
Claim 7
Independent Claim
191 words
A method of qualifying and sorting file records in a storage means into a sort buffer for temporary retention in an order based on a selected ranking, comprising th steps of: (a) accessing each of said file records in said storage means; (b) evaluating an accessed file record to determine if it qualifies for transfer to the sort buffer; (c) if said accessed file record qualifies, comparing a rank of the qualified file record in the storage means with the rank of a lowest ranked file record in the sort buffer; (d) if the rank of the qualified file record is higher than the rank of the lowest ranked file record, transferring the qualified file record in the storage means to the sort buffer; (e) deleting the lowest ranked file record from the sort buffer to facilitate storage of the qualified file record therein; (f) locating the qualified file record transferred to the sort buffer at a level based on the rank thereof; and (g) repeating steps (c)-(f) for each qualified file record in the storage means until the sort buffer has been loaded with the highest ranked records without overflowing.
Claim 8
Dependent Claim
57 words
A method of qualifying and sorting file records as set forth in claim 5 including the step of outputting the file records in the sort buffer after steps (c)-(g) have been repeated for each file record in the storage means for the highest ranked file records in the storage means not previously transferred to the sort buffer.
Claim 9
Dependent Claim
49 words
A method of qualifying and sorting file records as set forth in claim 6 including the step of repeating the outputting of file records from the sort buffer each time said buffer contains the highest ranked file records from the storage means not previously transferred to the sort buffer.
Claim 10
Dependent Claim
29 words
A method of qualifying and sorting file records as set forth in claim 7 including the step of transferring file records in the sort buffer to a disk storage.
References Cited (Backward Citations)
US3872442A
Cited
US4031520A
Cited
US4209845A
Cited
US4080651A
Cited
US4101968A
Cited
US4393470A
Cited
US4417321A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1988-04-08 | 1988-10-08 | 1989-04-09 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1992-04-08 | 1992-10-08 | 1993-04-09 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1996-04-08 | 1996-10-08 | 1997-04-09 | $7700.00 | Window Closed / Lapsed |