JPH03192437A - String directory sort merging system - Google Patents

Abstract

PURPOSE:To reduce the number of times for input / output by rearranging the string directory of a string, which is temporarily saved into an auxiliary storage, with the length of each string as a key and afterwards executing a merge processing. CONSTITUTION:After a classification processing on a first stage, data are temporarily saved as the string into the auxiliary storage and at a main storage, the string directory with the leading address and the string length of the string is prepared. In the second stage, the string directory is classified according to the string length and rearranged in an ascending order. Afterwards, the merge processing is executed. Thus, since the string directory is rearranged in the ascending order with the string length as the key before the merge processing, the number of times for input / output can be decreased and classification processing time can be shortened.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to the classification and merging of data processing systems, and particularly to the classification of large amounts of data that requires an auxiliary storage device as a temporary device during the classification process. This invention relates to a processing method when strings of non-uniform length (sequences of ordered data created by effectively utilizing the main memory) created in the first stage are merged in the second stage.

[Conventional technology]

Conventionally, this type of processing method has been used to store n strings created in the first stage and temporarily saved in the auxiliary storage device in m (m<n> ways (n The merging process is performed in ``Merge strings of books into one'', and when the number of strings becomes m or less, the third stage final merging process is performed.

[Problem to be solved by the invention]

In the conventional merging process in the second stage described above, strings are merged in the order in which they were saved, so depending on the content of the input data, if long strings with a large number of data items are created at the beginning of saving, these strings may be merged. The disadvantage of merging is that the number of inputs and outputs increases.

[Means to solve the problem]

According to the present invention, ``In the classification process of a large amount of data that requires not only the main memory but also the auxiliary memory, each auxiliary memory stores a string that is temporarily saved in the auxiliary memory. A string directory sorting and merging method is obtained, which is characterized in that string directories having the start address of are rearranged using the length of each string as a key, and then merged.

〔Example〕

Next, the present invention will be described in more detail with reference to the drawings showing one embodiment of the present invention.

Referring to FIG. 1, in one embodiment of the present invention, the portion surrounded by dotted lines is the portion added according to the present invention. After the first stage classification process, the string is temporarily saved as a string in the auxiliary storage device, and a string directory with the start address and string length of the string is created in the main storage device. In the second step, the string directory is sorted by string length and sorted in ascending order. After that, merge processing is executed.

FIG. 2 is a diagram illustrating a case where the second stage processing is performed according to the conventional method. When seven strings are created and these strings are merged in four ways, input and output are performed in units of 18 people in the illustrated example.

Figure 3 shows the case where the second stage processing in this embodiment is performed, and when the seven strings in Figure 2 are classified by string length and merged in four ways, the input is performed in a single car position with nine people. and output is performed. Therefore, compared to the conventional method, the input/output in the second stage is halved.

After the merging process shown in FIG. 3, the final merging process at the third stage is executed in four ways, but the number of inputs and outputs at this time is the same as in the conventional method.

〔Effect of the invention〕

As described above, according to the present invention, by rearranging string directories in ascending order using the string length as a key before merging processing, it is possible to reduce the number of inputs and outputs, and shorten the classification processing time.

[Brief explanation of drawings]

FIG. 1 is a flowchart showing the operation of an embodiment of the present invention, FIG. 2 is a diagram explaining the second-stage merging process in the conventional method, and FIG. 3 is a diagram explaining the second-stage merging process in the present embodiment. FIG.

Claims (1)

[Claims] A string directory with the start address of each string in the auxiliary storage device that is temporarily saved in the auxiliary storage device when classifying a large amount of data that requires not only the main storage device but also the auxiliary storage device. A string directory sorting and merging method is characterized in that the strings are sorted using the length of each string as a key and then merged.