Method of facilitating computer sorting

• US 4,939,639 A
• Filed: 06/15/1987
• Issued: 07/03/1990
• Est. Priority Date: 06/11/1987
• Status: Expired due to Fees

• Current Assignee: Nortel Networks Limited (Nortel Networks Corporation)
• Original Assignee: Northern Telecom Limited (Nortel Networks Corporation)
• Inventors: Lee, Eddy, Kulinek, Eugene
• Primary Examiner(s): MacDonald, Allen
• Assistant Examiner(s): Ray, Gopal C.
• Application Number:
  US07/061,510
• Time in Patent Office: 1,114 Days
• Field of Search: 364/200 MS File, 364/900 MS File, 364/419, 364/300
• US Class Current: 1/1
• CPC Class Codes: G06F 16/90348 by searching ordered data, e.g. alpha-numerically ordered data
• CPC Class Codes: G06F 40/274 Converting codes to words; Guess-ahead of partial word inputs
• CPC Class Codes: G06F 7/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 generalG06F7/36 takes precedence
• CPC Class Codes: Y10S 707/99937 Sorting

Abstract

A method of facilitating the alphabetical dictionary sorting, by computer, of words based upon characters from a multilingual alphabet, especially the repertoire of characters defined in the new standard alphabet known as ISO 8859/1. This invention uses an encoding scheme to determine the language dependent sort orders for the characters defined in ISO 8859/1. This encoding scheme removes the dependency of sorting on the character set'"'"'s internal collating representation. This method allows the same sorting software to support many (if not all) of the languages supported by the alphabet. By storing the language dependent sort orders as data files, the sorting software is immune to the user'"'"'s language and hence is highly portable. The number of languages supported is directly proportional to the number of data files available.

Claims

1. A machine method of generating a language dependent sortkey, to facilitate the alphabetical sorting of another alphabet using a common sorting routine, said method comprising the steps of:

(a) storing in a master file encoded words, formed from characters each having a preselected value, to be sorted;

(b) providing a language dependent data file having an alphanumerical encoding table for the language of said another alphabet, the table including an encoding indicator, a first sort order entry and a second sort order entry;

(c) comparing said value of a character from one of the encoded words in the master file against the alphanumerical encoding table to determine its corresponding entry;

(d) retrieving the encoding indicator from said table, corresponding to said corresponding entry, which indicates if the encoding process will be a one-to-one character encoding, a one-to-two character encoding, or an ignore character encoding;

(e) if the encoding indicator indicates the encoding is one-to one, utilizing the value in the first sort order entry, for said sortkey;

(f) if the encoding indicator indicates that the encoding is one-to-two, utilizing the values in both the first sort order entry and the second sort order entry, for said sortkey; and

(g) if the encoding indicator indicates that the encoding is an ignore encoding, ignoring any values for said sortkey; and

repeating from step (c) for each of the characters in the master file.

2. A machine method as defined in claim 1 in which said encoding table further includes an alternate sort order entry and said encoding indicator also indicates if the encoding process will be a potential two-to-two character encoding;

and which further comprises the step of;

(h) if the encoding indicator indicates that the encoding is a potential two-to-two character encoding, comparing the value of the second character in a character pair from the encoded words;

if the encoding indicator confirms a two-to-two character encoding, utilizing the value in the first sort order entry and the alternate sort order entry for said sortkey;

else utilizing the value in the first sort order entry for said sortkey, and then comparing the value of said second character repeating from step (c).