GB1403571A - Method and arrangement for sorting record units having keyfield bits arranged in descending order of significance without comparator - Google Patents

Method and arrangement for sorting record units having keyfield bits arranged in descending order of significance without comparator

Info

Publication number
GB1403571A
GB1403571A GB3291072A GB3291072A GB1403571A GB 1403571 A GB1403571 A GB 1403571A GB 3291072 A GB3291072 A GB 3291072A GB 3291072 A GB3291072 A GB 3291072A GB 1403571 A GB1403571 A GB 1403571A
Authority
GB
United Kingdom
Prior art keywords
addresses
numbers
location
store
locations
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
GB3291072A
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.)
Dirks Electronics Corp
Original Assignee
Dirks Electronics Corp
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
Priority claimed from US00162172A external-priority patent/US3815083A/en
Application filed by Dirks Electronics Corp filed Critical Dirks Electronics Corp
Publication of GB1403571A publication Critical patent/GB1403571A/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
    • 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
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F2207/22—Indexing scheme relating to groups G06F7/22 - G06F7/36
    • G06F2207/222—Binary data tree

Abstract

1403571 Data sorting system DIRKS ELECTRONICS CORP 13 July 1972 [13 July 1971] 32910/72 Heading G4M A data sorting system applies identifying addresses to a plurality of words containing a key field and transfers words containing the addresses between two stores to locations depending on successive bit values of the key fields. The bits of the key fields which may be stored in a circulating store are examined successively commencing with the most significant bit and the addresses are stored in store B in locations determined by the value of the key field bit i.e. the addresses for words having a key field bit of "0" are stored in successive locations starting at a first "0" location and the other addresses are stored in successive locations starting at a first "1" location. The addresses are then transferred to store A to locations determined by the second most significant bits of the keyword, commencing with the addresses in the "0" storage locations. A group number is associated with the address from the "1" location of the B store and is a "1" to distinguish the numbers in the tree of Fig. 2 which branch from the first "1" location. The numbers in the "0" storage location are then read back to store B followed by the numbers in the "1" location which have a zero group number and then by the numbers which have a "1" group number and are stored in the appropriate "0" or "1" locations. Addresses from the "1" location of store A have their group number incremented by one. This proceeds until the least significant digit of the keyfield has been read when the numbers are in the desired order. During each transfer addresses are read out in increasing order of their group number to identify (in Fig. 2) from which point in the tree they have branched. The group numbers against the letters k to t correspond to a sort on the binary digits representing the numbers 0, 1, 2, 3, 4, 5, 8, 9, 10, 11.
GB3291072A 1971-07-13 1972-07-13 Method and arrangement for sorting record units having keyfield bits arranged in descending order of significance without comparator Expired GB1403571A (en)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US00162172A US3815083A (en) 1971-01-07 1971-07-13 Method and arrangement for sorting record units having keyfield bits arranged in descending order of significance without comparator

Publications (1)

Publication Number Publication Date
GB1403571A true GB1403571A (en) 1975-08-28

Family

ID=22584467

Family Applications (1)

Application Number Title Priority Date Filing Date
GB3291072A Expired GB1403571A (en) 1971-07-13 1972-07-13 Method and arrangement for sorting record units having keyfield bits arranged in descending order of significance without comparator

Country Status (2)

Country Link
DE (1) DE2234186A1 (en)
GB (1) GB1403571A (en)

Also Published As

Publication number Publication date
DE2234186A1 (en) 1973-01-25

Similar Documents

Publication Publication Date Title
US4959811A (en) Content addressable memory including comparison inhibit and shift register circuits
US5010516A (en) Content addressable memory
US3601808A (en) Advanced keyword associative access memory system
GB1501998A (en) Sort apparatus and data processing system
GB1492067A (en) Computer with segmented memory
GB1532278A (en) Data processing system and memory module therefor
ES466290A1 (en) File qualifying and sorting system
GB1492260A (en) Data processing systems
Burge Sorting, trees, and measures of order
ES380987A1 (en) Multilevel compressed index search method and means
US3311887A (en) File memory system with key to address transformation apparatus
GB2125587A (en) A system and method for manipulating a plurality of data records
GB1470104A (en) Stored programme electronic computer
GB1512222A (en) Data processing apparatus
ATE91816T1 (en) PATTERN ADDRESSABLE STORAGE.
US3618027A (en) Associative memory system with reduced redundancy of stored information
US3733589A (en) Data locating device
EP1227405A3 (en) A method for providing a cache indexing scheme less susceptible to cache collisions
Bell The principles of sorting
US4852059A (en) Content addressable memory
GB2182789A (en) A content addressable memory
US3034102A (en) Data handling system
GB1403571A (en) Method and arrangement for sorting record units having keyfield bits arranged in descending order of significance without comparator
GB1358328A (en) Method of and apparatus for perfomring simultaneous content- searches
GB1383991A (en) Method and system for sorting without comparator

Legal Events

Date Code Title Description
CSNS Application of which complete specification have been accepted and published, but patent is not sealed