GB1385893A - Sorting of data records - Google Patents

Sorting of data records

Info

Publication number
GB1385893A
GB1385893A GB453871A GB453871A GB1385893A GB 1385893 A GB1385893 A GB 1385893A GB 453871 A GB453871 A GB 453871A GB 453871 A GB453871 A GB 453871A GB 1385893 A GB1385893 A GB 1385893A
Authority
GB
United Kingdom
Prior art keywords
sub
data
records
estimation
range
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
Application number
GB453871A
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Honeywell Information Systems Ltd
Bull HN Information Systems Italia SpA
Original Assignee
Honeywell Information Systems Ltd
Honeywell Information Systems Italia SpA
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Honeywell Information Systems Ltd, Honeywell Information Systems Italia SpA filed Critical Honeywell Information Systems Ltd
Priority to GB453871A priority Critical patent/GB1385893A/en
Priority to FR7204756A priority patent/FR2125433B1/fr
Priority to DE19722206738 priority patent/DE2206738A1/en
Publication of GB1385893A publication Critical patent/GB1385893A/en
Expired legal-status Critical Current

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
    • 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

1385893 Sorting data HONEYWELL INFORMATION SYSTEMS Ltd 31 Jan 1972 [12 Feb 1971] 4538/71 Heading G4M A data programming method and a data programmed computer for sorting a file of data records each of which is identified by a key is arranged to estimate, in terms of the keys, the distribution of the records and store the estimation, to make an index, based on the estimation dividing the records into consecutive sub-ranges each containing approximately the same number of records, determine which sub-range each record is situated in and sort the records in each sub-range. The Specification describes an estimation procedure (Figs. 3, 4, not shown) using a tree system counting words having certain keys, an index forming procedure, based on the estimation (Figs. 3, 5, not shown) which for alphabetic keys defines words or letters defining the upper and lower limits of each sub-range. The data in the sub-ranges are internally sorted and the subranges are chosen so that their content fills the computer internal memory. The Specification describes two procedures for performing sorts if the approximation used produces data in a sub-range which is up to 50% greater than the memory capacity and more than 50% greater than the capacity (Figs. 6, 7, not shown).
GB453871A 1971-02-12 1971-02-12 Sorting of data records Expired GB1385893A (en)

Priority Applications (3)

Application Number Priority Date Filing Date Title
GB453871A GB1385893A (en) 1971-02-12 1971-02-12 Sorting of data records
FR7204756A FR2125433B1 (en) 1971-02-12 1972-02-11
DE19722206738 DE2206738A1 (en) 1971-02-12 1972-02-12 PROCEDURE FOR SORTING DATA IN A FILE AND THE DATA PROCESSING SYSTEM WORKING IN ACCORDANCE WITH THIS PROCEDURE

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
GB453871A GB1385893A (en) 1971-02-12 1971-02-12 Sorting of data records

Publications (1)

Publication Number Publication Date
GB1385893A true GB1385893A (en) 1975-03-05

Family

ID=9779067

Family Applications (1)

Application Number Title Priority Date Filing Date
GB453871A Expired GB1385893A (en) 1971-02-12 1971-02-12 Sorting of data records

Country Status (3)

Country Link
DE (1) DE2206738A1 (en)
FR (1) FR2125433B1 (en)
GB (1) GB1385893A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5146590A (en) * 1989-01-13 1992-09-08 International Business Machines Corporation Method for sorting using approximate key distribution in a distributed system
GB2284079A (en) * 1993-11-19 1995-05-24 Hewlett Packard Co Sorting or merging lists

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5146590A (en) * 1989-01-13 1992-09-08 International Business Machines Corporation Method for sorting using approximate key distribution in a distributed system
GB2284079A (en) * 1993-11-19 1995-05-24 Hewlett Packard Co Sorting or merging lists

Also Published As

Publication number Publication date
FR2125433A1 (en) 1972-09-29
FR2125433B1 (en) 1973-06-29
DE2206738A1 (en) 1973-03-15

Similar Documents

Publication Publication Date Title
EP0380240A3 (en) Coded signature indexed databases
ES8402446A1 (en) Method for storing and accessing a relational data base.
GB1280487A (en) Multilevel compressed index searching
GB1277852A (en) Data processing systems
US5247662A (en) Join processor for a relational database, using multiple auxiliary processors
US3618027A (en) Associative memory system with reduced redundancy of stored information
US3434109A (en) Multifield comparator adjustable to compare any combinations of fields and to provide selectable bases of comparison
GB1385893A (en) Sorting of data records
GB1497678A (en) Data processing systems
Ayres et al. Author versus title: A comparative survey of the accuracy of the information which the user brings to the library catalogue
GB1280488A (en) Data processing systems
GB1384136A (en) Data processing systems
GB1418837A (en) Method and apparatus for searching and adding records to a sequential file in a small computing system
Bertsekas et al. Steepest descent for optimization problems with nondifferentiable cost functionals
GB889432A (en) Electronic computer system
JPS57137936A (en) File system of data
JPS57193837A (en) Retrieval system for data record having a plurality of keys
JPS63318628A (en) Horizontally dividing system for data base
Nolan Information storage and retrieval using a large scale random access memory
Allen et al. Data integrity in the GIANT system
GRAML et al. Computer based information systems for documentation. Preliminary study of the data processing project demonstration computerized literature documentation(DEMLID)(Survey and evaluation of computer based documentary information systems)
John et al. Interpretation of soil data by computer
GB1314781A (en) Data processing apparatus
Smith Book Review: The Future of the Past
GB1403571A (en) Method and arrangement for sorting record units having keyfield bits arranged in descending order of significance without comparator

Legal Events

Date Code Title Description
PS Patent sealed
PCNP Patent ceased through non-payment of renewal fee