JPH03216730A - Electronic computer - Google Patents

Abstract

PURPOSE:To execute successive processing of keys and to execute sorting even when plural kinds of key information are simultaneously designated by preparing a key for sorting plural kinds of designation from an input data, storing it and executing the sorting based on this key. CONSTITUTION:This computer is provided with a data input device 11, a data output device 12, a data storage device 13, a key storage device 14, a key designating means 15 for plural designation of keys, a key preparing means 16 for preparing different kinds of keys, and a sorting means 17 for executing the sorting. Plural kinds of means to convert from the data to the key is prepared, and when plural kinds of keys are designated, the kind of designated sorting is confirmed every time one key information is processed, and th key is prepared from a designated conversion method. The set of data record is stored based on that key. Thus, the sorting can be executed even when sorting methods with different key information is designated by applying the sorting of different methods in order.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a method for sorting data using a plurality of types of sorting conditions (hereinafter referred to as keys) when sorting data in an electronic computer.

[Conventional technology]

FIG. 6 is a flowchart showing a conventional sorting method. First, data is input 61 from a data input device. Divide the input data into fixed-length or variable-length records 62. The key information with the highest priority is set as the key information for key creation 63. A key is created 64 for all data records based on the key information.

65. Sort processing is executed. After sorting is completed, the key with the next highest priority is used as key information for key creation 66
. Then, a key is created again based on the key information, and data records whose order has not been determined by the previous sorting are sorted. The creation and sorting of keys is repeated until all of the specified key information is referenced or the data is completely sorted, and when finished, the sorted results are output to the output device 67.

[Problems to be Solved by the Invention] However, in the above-mentioned conventional technology, even if a plurality of pieces of key information are specified, the types of sorting of the key information are only one.
were limited in type. Also, even if there were several types of sorting, data was never sorted by applying multiple types of sorting in a single sort. As a result, it is impossible to sort data records with a complex data structure consisting of various data by specifying several different types of keys in a single operation. It was possible. Therefore, you can sort data by specifying certain key information, and then use the resulting data to specify another key information and sort.
It needed to be processed.

In view of such problems, it is an object of the present invention to provide a means for quickly and efficiently realizing sorting using multiple types of key information.

[Means for Solving the Problems] The present invention includes a data input device, a data output device, a data storage device, means for specifying a plurality of types of keys for sorting, and a method for inputting the keys for sorting. The present invention is characterized by comprising a plurality of types of creation means for creating from data, a storage device for the keys created for sorting, and means for sorting based on the keys.

[Operation] In the present invention, multiple types of means for converting data into keys are prepared, and when multiple types of keys are specified, the specified sort type is changed every time one key information is processed. Check and create a key using the specified conversion method. Then, data records can be sorted in the manner specified by each key information. This method has the advantage that even if multiple types of key information are specified at the same time, sorting is possible by sequentially processing the keys.

[Example code] Embodiments of the present invention will be described below based on the drawings.

(Embodiment 1) FIG. 1 is a block diagram of the present invention, in which a data storage device 1
3, a storage device 14 for keys created for sorting, a device 11 for inputting data, and a device 12 for outputting sorted data, and means i5 for specifying keys for sorting. , means 16 for creating keys of different types, and means 17 for performing sorting. FIG. 3 is a flowchart of the present invention. It is assumed that three types of key information are specified, and key information 1, key information 2, and key information 3 are designated in order of priority. It is assumed that all of these key information are required to be sorted in different ways, for example, key information 1 is ordered in numerical order, key information 2 is ordered in kanji code order, and key information 3 is arranged in alphabetical order.

Furthermore, the data is a collection of fixed-length records separated by a certain length. First, data is read 31 from the input device. Next, since it is a collection of fixed length data, the data is divided into data records by a certain length 32. After the division into data records is completed, a key creation means based on the key information is selected 33, a key is created 34, and a key record is set 35. For each data record, combine multiple types of keys,
Create a key record as shown in Figure 2. When creating a key record, it is necessary to combine keys created by multiple types of sorting methods into one large key, so the creation criteria for all keys must be set to either an ascending order key or a descending order key. There is a need to unify. Here, key conversion by each sorting method is based on ascending order. First, based on key information 1 having a high priority, data is converted into a key in the numerical order specified by key information 1 to obtain key 1, and key 1 is registered in the key record area. At this time, key information 1 is a key created for ascending order if descending order sorting is specified, so convert the keys so that their sizes are reversed, and register the resulting key. .

Next, the process moves to key information 2, and key 2 is created from the data in the order of the kanji code. As with key 1, processing for descending order is also performed for key 2 if necessary.

The obtained key 2 is set after key 1 in the key record. Furthermore, the key information 3 is converted into keys in alphabetical order, and the key 3 is created and registered in the key record. In the form of key 1, key 2, and key 3,
As shown in Figure 2, there is one key record. A key record is created for every data record, and the data records and key records are made to correspond one-to-one. Once all key records have been created, the key records are compared and sorted in ascending order 36. Any sorting method may be used, such as quick sort or bubble sort. If the key records can be sorted, the key records and data records have a one-to-one correspondence, so sorting of the data records has also been completed. Finally, the process ends when the data records are output to the output device in the sorted order 37. In this way, even if different sorting methods are specified for each piece of key information, sorting is possible by converting it into keys, collecting those keys as a key record, and sorting them as one large key.

(Example 2) It is assumed that two types of key information are specified, key information 1 and key information 2 in order of priority, and methods in decimal order and hexadecimal order are specified, respectively. The data is a collection of variable length data records separated by a certain delimiter.

First, data to be sorted is read from an input device, and the data is divided into data records using delimiters. Here, without creating a key record, first, sorting is performed using key information 1, and then sorting is performed using key information 2. A key of key information 1 corresponding to each data record is created based on the specified method. As shown in Figure 4,
After creating all the keys of key information 1 corresponding to each data record, the data records are sorted based on the keys of key information 1. After the sorting using the key information 1 is completed, the key information 2 is applied to the data for which the sorting was not completed because the keys according to the key information 1 were the same, and the sorting is performed by applying the key information 2. Therefore, for example, if data records 2 and 6 have the same key 1, only those two data records are retrieved. Since key information 2 has a different sorting method than key information 1, keys are created using the method of key information 2, as shown in FIG. 5, based on the specified sorting method. Then, the data records for which keys have been created are sorted, and the keys are compared and sorted. The results obtained from this sorting are output to the output device. Any number of key information may be specified as long as it is possible for processing, and the number of types of sorting methods also varies.
Any number of methods may be used as long as they can be processed by sorting. Also, there may be keys that have the same specified method.

[Effects of the Invention] According to the present invention described above, when sorting a collection of data records based on a plurality of key information, even if different sorting methods are specified for each key information,
Sorting can be performed by sequentially applying these different methods of sorting. Furthermore, by combining keys generated by different sorting methods into a key record, sorting by mixed sorting methods can be processed more efficiently.

[Brief explanation of drawings]

FIG. 1 is a block diagram showing the configuration of an electronic computer according to the present invention. FIG. 2 is a diagram showing the relationship between data records and key records. FIG. 3 is a flowchart showing one embodiment of the present invention. FIG. 4 and FIG.
FIG. 3 is a diagram showing the relationship between data records and keys created using key information. FIG. 6 is a flowchart showing conventional sorting means. 11 1 2 1 3 1 4 15 16 Data input device Data output device Data storage device Key Storage device Means for specifying multiple storage keys Means for creating keys for each 1 7 Sorting means and above

Claims (1)

[Claims] a data input device, a data output device, a data storage device, means for specifying a plurality of types of sorting conditions for sorting, and a plurality of types of creating means for creating the sorting conditions for sorting from the input data; An electronic computer comprising: a storage device for the sorting conditions created for sorting; and means for sorting based on the sorting conditions.