GB1314781A - Data processing apparatus - Google Patents
Data processing apparatusInfo
- Publication number
- GB1314781A GB1314781A GB4527971A GB4527971A GB1314781A GB 1314781 A GB1314781 A GB 1314781A GB 4527971 A GB4527971 A GB 4527971A GB 4527971 A GB4527971 A GB 4527971A GB 1314781 A GB1314781 A GB 1314781A
- Authority
- GB
- United Kingdom
- Prior art keywords
- store
- records
- strings
- sequence
- record
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/22—Arrangements for sorting or merging computer data on continuous record carriers, e.g. tape, drum, disc
- G06F7/24—Sorting, i.e. extracting data from one or more carriers, rearranging the data in numerical or other ordered sequence, and rerecording the sorted data on the original carrier or on a different carrier or set of carriers sorting methods in general
Landscapes
- Engineering & Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Computer Hardware Design (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
1314781 Sorting digital data INTERNATIONAL BUSINESS MACHINES CORP 29 Sept 1971 [31 Dec 1970] 45279/71 Heading G4M Data processing apparatus is arranged to sort data into strings, which are subsequently merged to produce a single sorted output sequence, using a fist storage area with a capacity of LL records and a second storage area with a capacity RxLL such that the lengths of the strings can be varied by adjusting the multiplier R to suit the equipment available for merging the strings. The first LL records of an unsorted sequence are entered into the first store; a comparison is then made between the record in the store having the lowest sort key and the subsequent records in the sequence. Each time the comparison is made, if the subsequent record is higher it replaces the lowest record in the first store and this lowest record is appended to an output string; if however the subsequent record is lower it is placed in the second store. When the second store is full (i.e. it contains RxLL records) the output string is completed by adding to it, in sequence, the LL records remaining in the first store and a new output string is started. The first LL records from the second store are entered into the first store and the comparison made as before with each of the records left in the second store and then with those in the unsorted sequence. As before lower records are returned to the second store and when it is again full the second string is completed. This is repeated until all the input records have been allocated to output strings which are then merged in known manner. The first storage area is in primary storage while the second storage area and the stored strings are in secondary storage. The method is useful in a time sharing computer since the lengths of the output strings are not limited by the size of primary storage available.
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10308570A | 1970-12-31 | 1970-12-31 |
Publications (1)
Publication Number | Publication Date |
---|---|
GB1314781A true GB1314781A (en) | 1973-04-26 |
Family
ID=22293311
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
GB4527971A Expired GB1314781A (en) | 1970-12-31 | 1971-09-29 | Data processing apparatus |
Country Status (3)
Country | Link |
---|---|
DE (1) | DE2164836A1 (en) |
GB (1) | GB1314781A (en) |
IT (1) | IT943928B (en) |
Families Citing this family (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
DE102005061103A1 (en) * | 2005-12-21 | 2007-07-05 | Schaeffler Kg | Rolling bearings with improved board geometry |
-
1971
- 1971-09-29 GB GB4527971A patent/GB1314781A/en not_active Expired
- 1971-12-14 IT IT3235471A patent/IT943928B/en active
- 1971-12-27 DE DE19712164836 patent/DE2164836A1/en active Pending
Also Published As
Publication number | Publication date |
---|---|
DE2164836A1 (en) | 1972-11-16 |
IT943928B (en) | 1973-04-10 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US2735082A (en) | Goldberg ett al | |
US2800277A (en) | Controlling arrangements for electronic digital computing machines | |
US4575798A (en) | External sorting using key value distribution and range formation | |
US5307485A (en) | Method and apparatus for merging sorted lists in a multiprocessor shared memory system | |
US4295206A (en) | Document sorting method | |
US2798216A (en) | Data sorting system | |
US5117495A (en) | Method of sorting data records | |
GB1277852A (en) | Data processing systems | |
GB1280487A (en) | Multilevel compressed index searching | |
US5247662A (en) | Join processor for a relational database, using multiple auxiliary processors | |
US2674732A (en) | Electronic variable delay circuits | |
GB1280486A (en) | Multilevel compressed index generation | |
GB1314781A (en) | Data processing apparatus | |
JPS60105039A (en) | Collation system of character string | |
JPH0666050B2 (en) | Sort processing method | |
US3596258A (en) | Expanded search method and system in trained processors | |
GB1418837A (en) | Method and apparatus for searching and adding records to a sequential file in a small computing system | |
US4054787A (en) | Apparatus for computing an arithmetically accumulated sequence of numbers | |
JPS6154536A (en) | Data regulating circuit | |
JPS56111961A (en) | Data file control device | |
Guffin | A computer for solving linear simultaneous equations using the residue number system | |
Williams | Storage utilization in a memory hierarchy when storage assignment is performed by a hashing algorithm | |
US2850233A (en) | Electronic five's multiple generator | |
JPH0377536B2 (en) | ||
GB1378982A (en) | Data processing apparatus |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PS | Patent sealed | ||
PCNP | Patent ceased through non-payment of renewal fee |