JPH03216729A - Elctronic computer - Google Patents

Abstract

PURPOSE:To manage data at one location without being scattered inside by allowing all data to be compared in the case of sorting to be a part of a key. CONSTITUTION:This electronic computer is constituted of a data input device 11, a data output device 12, a data storage device 13, a key storage device 14, a means 15 to divide an input data to a record, a key preparing means 16, a key record preparing means 17, a data order specifying means 18, and a sorting means 19. In the case of executing the sorting, all the key to be compared are collected as key record. Thus, the key for sorting is not scattered in a data area, and it can be managed in one location.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to the structure of sort conditions (hereinafter referred to as keys) for efficiently sorting data in an electronic computer.

[Prior Art] FIG. 6 is a flowchart showing a conventional sorting method. First, data is input 61 from a data input device. β2 divides the input data into fixed or variable length records. 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.

Two types of sort processing, ascending order sorting and descending order sorting, are prepared, and the sorting processing to be executed is selected by specifying ascending order or descending order, and the sorting is performed 65. After sorting is completed, the key with the next highest priority is set as key information for key creation 66.

Then, based on that key information, keys are created again, and the order is sorted according to the previous sorting. Sorts the data records for which the data has not yet been determined. Also, if the keys are exactly the same as a result of sorting, and there is a request to arrange the same data records in the order of data input, either review the sorted results including the original order, or , the order will not be swapped if the key values are the same.

Repeat creating and sorting keys until all of the specified key information is referenced or the data is completely sorted.
Upon completion, the sorted results are output to the output device 67.

[Problems to be Solved by the Invention] However, in the above-mentioned prior art, if multiple pieces of key information are specified, keys are created and sorted for each piece of key information. The more specifications there are, the more iterative processes will be required for key creation and sorting.

Furthermore, when sorting is performed using the second or subsequent keys, there is no need to perform sorting on data whose order has been determined by sorting using previous key information.

Therefore, in order to distinguish whether the data is unconfirmed or not, a flag is set for each data record.
Alternatively, some processing must be performed, such as storing an undefined data range. In addition, if you first create keys corresponding to the key information of a data record as many keys as the number of key information, compare the keys based on the key information with the highest priority, and once the size relationship is determined, follow the specified ascending or descending order. Sort. If the compared keys are the same, the key with the next highest priority is extracted and sorted in ascending or descending order. In this way, if the keys are the same, the keys with the next priority are compared in sequence. However, with this method, if a different sorting direction is specified for each key, the sorting direction must be determined and the sorting process must be selected each time the next key is compared. From this point of view, when sorting using the conventional method, depending on the number of key information and the nature of the data located in that key part, there is a large number of repeated processes, which increases the processing time and at the same time the sorting is completed. It is necessary to identify the areas where
There is a problem in that such complicated processing is required.

Furthermore, when a plurality of keys are specified, it is necessary to determine the sorting direction and select the sorting process for each key, which is inefficient. In view of these problems, it is an object of the present invention to provide a means for realizing high-speed and efficient sorting.

[Means for Solving the Problems] The present invention includes a data input device, a data output device, means for dividing input data into records, a data storage device, and a method for creating keys for sorting from data. a procedure, a means for specifying the order of the input data, a means for grouping keys for the same data record as a key record of 1'), a storage device for the keys created for sorting, and a storage device for the keys created for sorting; and means for sorting based on.

[Operation] In the present invention, when multiple keys are specified, 1
For one data record, first create keys that correspond to all of the specified multiple key information, and then combine those keys into one key record as shown in Figure 3. Furthermore, after creating a key for ascending order by considering the sorting direction for each key, for keys that are specified for descending order, all bits of that key are reversed to reverse the magnitude relationship. Register the value in the key record. By creating a one-to-one correspondence between a data record and a key record consisting of multiple keys, comparing the entire key record allows you to obtain the same result as repeatedly comparing multiple keys. . Furthermore, if there are data records with exactly the same specified sorting key, it may be necessary to arrange the data with the same keys in the original data order. In this case, the order of the original data record is set in the key record as the key with the lowest priority. With this method, it is possible to perform sorting without repeating key creation and sorting, reduce processing time, and eliminate the complexity caused by repetition. Also, when performing sorting, all the keys to be compared are grouped together as one key record, so the keys for sorting are not scattered in the data area.
It has the advantage of being able to be managed in one place.

[Examples] Examples 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. A means 15 for dividing into data records, a means 16 for creating a key from data, and a means 1 for creating one key record by combining a plurality of keys.
7, and means 18 for specifying the input order of data;
Means 19 for performing sorting are provided.

FIG. 5 is a flow chart of the present invention. Assuming that two types of key information are specified, the one with the highest priority is designated as key information 1 and key information 2. Furthermore, the data is a collection of fixed-length records separated by a certain length. First, data is read 51 from the input device. Next, since the data is a collection of fixed length data, the data is divided into data records of a certain length 52. After the division into data records is completed, a key record is created 53 for each data record. The relationship between data records and key records is shown in Figure 2. Management information can be used as needed, or can be omitted. First, data is converted into a key based on key information 1, which has a high priority, to obtain key 1, and key 1 is registered in the key record area. At this time, it is determined whether the order is ascending or descending, and if ascending sort is specified, it is registered as is. In the case of descending sorting, it is necessary to arrange data with large values in the front and data with small values in the rear, so it is necessary to reverse the magnitude of all key values. Therefore, by inverting all bits, the magnitude is inverted, comparison processing is performed in the same procedure as ascending order sorting, and sorting is performed in descending order. Next, a key 2 is created from data based on the key information 2.

For key 2, processing for ascending and descending order is performed in the same way as for key 1. The obtained key 2 is set consecutively after key 1 in the key record. The key record is as shown in FIG. 3, and key 1 and key 2 are combined into one key record. A key record as shown in FIG. 3 is created for every data record, and data records and key records are made to correspond one-to-one. Once all key records have been created, compare the key records and sort them in ascending order54. 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, output the data records to the output device in the sorted order and you are done.5
5.

(Example 2) Three types of key information are specified, and key information 1, key information 2, and key information 3 are specified in descending order of priority, and key information 1 is specified in ascending order, and keys 2 and 3 are specified in descending order. shall be. Further, if the keys are exactly the same, the data records are sorted so that the data record inputted first comes first. The data is a collection of variable length data records separated by a certain delimiter. First, the data to be sorted is read from the input device, and the 7'-data is divided into data records using delimiters. Then, create a key record corresponding to each data record. Let keys obtained according to key information 1, key information 2, and key information 3 be key 1, key 2, and key 3, respectively. Key information 2
, 3 are in descending order, all bits of the values of keys 2 and 3 are inverted so that the magnitude relationship between the values of keys 2 and 3 is reversed.

A key record is created by arranging the obtained keys in order of priority. Here, data indicating the position or order of data records within the input data is registered in the key record following key 3 as the key with the lowest priority to create a key record as shown in FIG. The value to be registered at this time may be any value as long as the data record located earlier in the order has a smaller value than the data record input later. After all key records corresponding to each data record are created in this way, the size relationship between the data records is determined by comparing the key records, and sorting is performed. After sorting is complete, output the results to the output device.

The key record may include management information such as data length. However, it should not be included in the comparison key when performing sorting. Also, each key record may be of variable length or fixed length, but if multiple keys are specified, the length of the key corresponding to each key information can be found in the key record. Make it. Further, when a plurality of pieces of key information are specified, it does not matter where each piece of key information is specified as a key in the original data.

Further, the key positions may overlap on the original data.

[Effects of the Invention] According to the present invention described above, even when sorting is performed based on a plurality of pieces of key information, it is no longer necessary to repeatedly create keys for each number of key information and perform sorting, and the processing is simplified. It is possible to improve time efficiency. Furthermore, after the first sorting, it is possible to eliminate the complication of extracting only the portions whose order has not been determined and performing the second and subsequent sorting. The order in which data is input is also treated as part of the key. In this way, by making all the data to be compared when sorting part of the key, the data can be managed in one place without being scattered internally, and the data structure becomes easier to understand.

[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. FIGS. 3 and 4 are diagrams showing the structure of a key record. FIG. 5 is a flowchart showing one embodiment of the present invention. FIG. 6 is a flowchart showing conventional sorting means. l1 ...... Data input device 1 2 1 3 1 4 1 5 Data output device Data storage device Key storage device Means for dividing input data into records Key creation means Key record creation means Data order specifying means Sorting means and above

Claims (1)

[Claims] Data input device, data output device, input data 1
means for dividing each record, a data storage device, a procedure for creating sort conditions for sorting from data, a means for specifying the order of the input data, and a means for dividing sort conditions for the same data record into one 1. An electronic computer comprising: means for organizing a sort condition record; a storage device for the sort conditions created for sorting; and means for sorting based on the sort conditions.