GB1378982A - Data processing apparatus - Google Patents
Data processing apparatusInfo
- Publication number
- GB1378982A GB1378982A GB4615172A GB4615172A GB1378982A GB 1378982 A GB1378982 A GB 1378982A GB 4615172 A GB4615172 A GB 4615172A GB 4615172 A GB4615172 A GB 4615172A GB 1378982 A GB1378982 A GB 1378982A
- Authority
- GB
- United Kingdom
- Prior art keywords
- strings
- phase
- store
- equal
- data
- 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/36—Combined merging and sorting
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)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
1378982 Data sorting and merging system INTERNATIONAL BUSINESS MACHINES CORP 6 Oct 1972 [17 Nov 1971] 46151/72 Heading G4M A programmed data processor using memory discs is used to sort strings of data and merge the sorted strings into a final ordered string. The sorting is carried out in four Phases. In the first Phase, Phase 0, various parameters required for the sorting process are calculated. Blocking Factor B equal to the number of records that can be read into or out of store in a single operation, G, equal to the number of records that can be held in store at one time and equal to the storage area less the area required for buffers and stored programs and M2 and M3, the merge orders for Phase 2 and Phase 3 and equal to the number of sequences that can be formed in one pass to form a longer sequence. Phase 1 is the Internal Sort (Figs. 9A, 9B, not shown). Data from the input file is read into the store and the lowest numbered record is fed into a work file. The next record, if it is higher than the last record in the work file, is read into store and the procedure repeated. If a new record is lower than the last record in the work file it is read into store and tagged as unuseable. The procedure is repeated until either the output buffer is full or all the records in store are tagged and so produce a sequence break. In the latter case the tags are cleared and a new output string is produced. In the former the data is stored and the sorting proceeds. If the final number of strings produced is less that or equal to M3 then Phase 3 is performed. Otherwise Phase 2 is performed. Phase 2 is the External Sort or Intermediate Merge (Figs. 12A, 12B, 12C, not shown) in which the strings from Phase 1 are merged to form a number of strings equal to or less than M3. An optional sequence for merging is calculated so that the minimum number of record handlings occur to produce the M3 strings and this may involve using null strings, i.e. strings containing no data so that less than M2 actual strings are used in the merge (Figs. 16, 17, not shown). When the M3 strings are produced Phase 3 performs the final merge.
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US19969171A | 1971-11-17 | 1971-11-17 |
Publications (1)
Publication Number | Publication Date |
---|---|
GB1378982A true GB1378982A (en) | 1975-01-02 |
Family
ID=22738611
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
GB4615172A Expired GB1378982A (en) | 1971-11-17 | 1972-10-06 | Data processing apparatus |
Country Status (1)
Country | Link |
---|---|
GB (1) | GB1378982A (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB2284079A (en) * | 1993-11-19 | 1995-05-24 | Hewlett Packard Co | Sorting or merging lists |
-
1972
- 1972-10-06 GB GB4615172A patent/GB1378982A/en not_active Expired
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB2284079A (en) * | 1993-11-19 | 1995-05-24 | Hewlett Packard Co | Sorting or merging lists |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CA1138568A (en) | Document sorting method | |
US4785400A (en) | Method for processing a data base | |
JPH02178730A (en) | Internal sorting system using dividing method | |
GB1512713A (en) | Data processing system | |
GB958831A (en) | Improvements in apparatus for sorting recorded digital data | |
GB1533189A (en) | Information-transmitting apparatus | |
US3806883A (en) | Least recently used location indicator | |
GB1280486A (en) | Multilevel compressed index generation | |
GB1378982A (en) | Data processing apparatus | |
JPS6142031A (en) | Sorting processor | |
US3387274A (en) | Memory apparatus and method | |
GB1187427A (en) | Data Storage System | |
US3662402A (en) | Data sort method utilizing finite difference tables | |
JPS6154536A (en) | Data regulating circuit | |
JPS5745658A (en) | Data storage system | |
JPS5736487A (en) | Data storage device | |
GB1405278A (en) | Data processing system when programmed to perform a sort operation | |
GB1314781A (en) | Data processing apparatus | |
JPH0145648B2 (en) | ||
GB1289451A (en) | ||
JPH01177124A (en) | Sorter memory control system | |
JPS62118435A (en) | Plural indexes generating system | |
JPS63253431A (en) | Retrieving system for data base of inverted structure | |
GB1399875A (en) | Sorting operations on digital data processing systems | |
Weller | A Rapid Computer Search Technique for Astronomical Catalogs |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PS | Patent sealed | ||
PCNP | Patent ceased through non-payment of renewal fee |