JPH03269619A - Sort processing system using kanji field as sort key - Google Patents

Abstract

PURPOSE:To improve the sort processing efficiency and also to reduce the memory capacity by storing a sort KANJI (Chinese character) order table used for sort processing into a system common virtual storage as the shared software and having accesses in common among plural processes. CONSTITUTION:The number N of KANJI fields designated as sort keys is obtained from a sort parameter table 2. Then '1' is set to a control variable I so that the position L, the number S of characters, and the KANJI order element T of the I-th KANJI field are obtained from the table 2. At the same time, an identification name X of a sort KANJI order table stored in a common software virtual storage area 4 corresponding to the element T is obtained from a sort KANJI order control table 7. Then '0' is set to a control variable J, and a code C of the (L+J)-th KANJI counted from the tip of a record is obtained. Furthermore the collating order value N of the code C is obtained by reference to the sort KANJI table of the name X and adds the value N to the record. The comparison is carried out between J and S. If J is larger than S, '1' is added to the value of I. Then I is compared with N. If I is larger than N, the processing is through. Thus the sort efficiency is improved.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a sort processing method that performs sorting using a kanji field composed of kanji characters expressed by kanji codes as a sort key.

[Conventional technology]

Conventionally, the kanji order table for defining the size relationship of kanji expressed by kanji codes is stored in a file in the auxiliary notation device, and when sorting using the kanji field as a sort key, the user can A file (sorted kanji order table file) in the auxiliary storage device in which the kanji order table is stored must be allocated, and in the sorting process, the sorted kanji order table assigned by the user must be allocated for each gram. The required sorted Kanji order table was loaded from the file into the work memory used by the program.

[Problem to be solved by the invention]

The above-mentioned conventional method of sorting using a kanji field composed of kanji characters represented by kanji codes as a sort key has the following drawbacks.

The user must allocate a file (sorted kanji order table file) in the auxiliary storage device in which the sorted kanji order table is stored, and in the sorting process, the user's allocation ( Since it was necessary to load the necessary sorted kanji order table from the sorted kanji order table file into the work memory used by the program, the process of loading the sorted kanji order table from the file changed to the sort process using the kanji field as the sort key. This causes a decrease in sort processing efficiency when performing .

Furthermore, each program that uses a Kanji field as a sort key must allocate a memory area for the sorted Kanji order table file and for loading the sorted Kanji order table from the sorted Kanji order table file. , when a large number of systems operate simultaneously, the amount of memory used by the entire system increases.

An object of the present invention is to provide a sort processing method using a kanji field as a sort key, in which the process of loading a sorted kanji order table from a file does not cause a decrease in sort processing efficiency and requires less memory usage. be.

[Means to solve the problem]

The sort processing method of the present invention using a Kanji field as a sort key includes a user program that requests sort execution, a sort parameter table for the user program to define sort parameters, and a work area for executing the sort. The sort work area used and the shared software are stored as shared software in the virtual storage area and consist of two parts: sort main processing and kanji additional field generation processing, and provide kanji order elements for kanji fields. A table for defining the size relationship between kanji codes and the sort processing means stored in the kanji code, which is stored as shared software in the shared software virtual storage area, and which stores kanji codes and the corresponding kanji order elements of the kanji of the kanji code. A sorted Kanji layer table with a unique identifier consisting of pairs of collation sequence values indicating ordinal values according to the table.

The sorting processing means includes a sorted kanji ordering table management table consisting of a pair of kanji ordering elements provided by the sorting processing means and identification names of the sorted kanji layer table corresponding to the kanji ordering elements; setting in the sort parameter table the position and number of characters of the kanji field in the record, the kanji order element for that key, and other parameters necessary for sorting, and passing control to the sort processing means in the shared software virtual storage area; When the sorting processing means is given control from the user program, it starts the sorting main processing, and the sorting main processing reads records to be sorted one by one into the sorting work area and stores one record. Each time it is read, the kanji additional field generation process is called, and when control is returned to the sort main process, the order of the records is determined by comparing the kanji additional fields added to the records by the kanji additional field generation process, The sorting process is performed, and the kanji additional field generation process checks the kanji order element for the kanji field specified in the sort parameter table, and determines the identification name of the sorted kanji layer table that corresponds to the kanji order element. Specified in the sorting parameter table while referring to the sorting kanji layer table, which is obtained from the sorting kanji order table management table and is implemented as shared software in the shared software virtual storage area and has the identification name. Starting from the position of that Kanji field, the collation sequence value of the Kanji code of each Kanji in the range equal to the number of characters of that Kanji field specified in the sort parameter table is added to the Kanji of the record that has been moved to the sort work area. By adding as an additional field, a kanji additional field is generated.

[Effect]

Since the sorted Kanji layer table is stored as shared software in the system's shared virtual storage, there is no longer a need to load the sorted Kanji layer table from a file, which improves sort processing efficiency and reduces memory usage. be done.

〔Example〕

Next, embodiments of the present invention will be described in detail with reference to the drawings.

FIG. 1 is a block diagram of a sort processing method using a Kanji field as a sort key, according to an embodiment of the present invention.

In this embodiment, the user program 1 that requests sort execution is
, a sort parameter table 2 for the user program 1 to define sort parameters, a sort work area 3 used as a work area for executing sorting, and shared software that can be commonly accessed by multiple processes. a shared software virtual storage area 4 for processing the data; and a sort processing means 5 which is implemented as shared software within the shared software virtual storage area 4 and consists of two parts: a sort main processing 51 and a kanji additional field generation processing 52; It is a table for defining the size relationship of kanji codes, and it is a table for defining the size relationship of kanji codes.It is a table for defining the size relationship of kanji codes, and includes a sort kanji layer table 6 implemented as shared software in the shared software virtual storage area 4, and kanji order elements (e.g. sorted kanji order table management table 7 for showing the correspondence between the sorted kanji layer table 6 and the corresponding sorted kanji layer table 6
It is made up of.

The user program 1 stores, in the sort parameter table 2, the position and number of characters in the record of the kanji field defined as the sort key, the kanji sequence element for that kanji field, and other record characteristics (variable length/
Parameters necessary for sort execution, such as fixed length type, record length, etc., memory size for sorting, work file, etc., are set, and control is passed to the sort processing means 5 in the shared software virtual storage area 4.

FIG. 2 is a diagram showing the format of parameters set in the sort parameter table 2 by the user program 1.

The parameters are the number of kanji fields specified as sort keys (21), and the relative position of each kanji field within the record.
221, 231, the number of characters 222° 232, kanji order elements 223, 233 for the kanji field, and other parameters necessary for sorting.

FIG. 3 is a diagram showing the contents of the sorted kanji order table 6.

The sorted kanji order table 6 has one entry for each kanji character expressed by a kanji code, and each entry has a kanji code of 3.
11,321.331 and collation order 1312°322.332, which indicates the order in which the Kanji code is ranked according to the corresponding Kanji order element.

FIG. 4 is a diagram showing the contents of the sorted kanji order table management table 7.

The sorted kanji order table management table 7 has one entry for each kanji order element provided by the sort processing means 5, and each entry contains the identification of the kanji order element 411, 421, 431 and the corresponding sort m-character order table 6. Name 412,422.
It consists of 432 sets.

The sort processing means 5 uses user programs 1 to III.
When Il is passed, the sort main processing 51 is activated.

FIG. 5 is a flowchart showing the processing steps of the main sorting process 51.

First of all, preparations necessary for sort execution are made, such as securing memory/work files for sorting and checking the parameters (record length, variable length/fixed length type) of sort input/output files (step 501), and then sorting targets. Input one record into the sorting work area 3 (step 502), determine whether there are no more input records (step 503), and if there are still input records, call the kanji additional field generation process 52. A kanji additional field is generated in the record input in step 502 (step 504). After that, the size of the record is determined by comparing the added kanji additional field, and the record is sorted. As an intermediate result of sorting, an ordered record string called a string is output to a work file. Returning to step 502 (step 505), if the input record has already disappeared in step 503, the process moves to string merging processing. Compare the number of strings in the work file with the number of strings that can be merged in one merge process (Step 506); if the number of strings in the work file is less than or equal to the number of strings that can be merged in one merge process; If not, the process moves to the final merging process (step 508); otherwise, the strings in the work file are merged and output to the work file again (step 507), and the process returns to step 506.

Step 508 is a final merging process in which strings in the work file are merged into one final string and output to an output file. At this time, the kanji additional field added in step 504 is deleted. When all records have been output in step 508, the process ends.

Figure 6 shows the Kanji additional field generation section 3B! 5 is a flowchart showing 52 processing steps. When control is passed from the sort main processing 51, first, the number N of the Kanji field designated as the sort key is obtained from the sort parameter table 2 (step 601). Next, set 1 to the iII11ml variable I (step 602), and obtain the number of characters WL9 in the first kanji field and the kanji order element T from the sort parameter 2 (step 603). From the sorted kanji order table management table 7, the identification name xt of the sorted kanji order table in the shared software virtual storage area 4 that corresponds to the kanji order element T! - Obtain (step 604>. Next, the control variable -
is set to O (step 605), and the kanji code C@- of the L1Jth kanji from the beginning of the record is obtained (step 606). Next, refer to the sorted kanji order table for the identifier X to obtain the collation order value N for the kanji code C (step 607
), the collation sequence value N is added as a kanji additional field to the record (step 60B). Add 1 to the value of - (step 609) and compare J and S (step 610)
, if J is smaller than S, the process returns to step 606 and the next character is 1! ! If J is greater than or equal to S, add 1 to the value of I (step 6.11), compare I and N (step 612), and if I is less than or equal to N, return to step 603 and enter the next kanji field. The process continues, and if ■ is greater than N, the process is terminated and control is returned to the sort main process 51.

[Effects of the Invention] As explained above, the present invention stores a sorted kanji layer table used in sort processing using a kanji field as a sort key as shared software in a shared virtual storage area of the system, and allows multiple processes to access it in common. In the sort process using the kanji field as the sort key, the file storing the sorted kanji layer table (sorted kanji layer table file) and the memory area for loading the sorted kanji layer table from the sorted kanji layer table file are blocked. []By eliminating the need to allocate for each Durham,
By omitting the process of loading the sorted kanji layer table from a file (sorted kanji layer table file) during the sorting process, execution performance is improved and the memory usage of the entire system is reduced.

[Brief explanation of drawings]

FIG. 1 is a block diagram of a sorting method according to an embodiment of the present invention, FIG. 2 is a diagram showing the contents of the sorting parameter table 2, FIG. 3 is a diagram showing the contents of the sorting kanji layer table 6, and FIG. 4 is a diagram showing the contents of the sorting parameter table 2. Figure 5 shows the contents of the sorted kanji layer table management table 7.
This figure is a flowchart showing the processing of the main sorting process 51, and FIG. 6 is a flowchart showing the processing of the kanji additional field generation process 52. DESCRIPTION OF SYMBOLS 1... User program, 2... Sort parameter table, 3... Sort work area, 4... Shared software virtual storage area, 5... Processing means, 51... Sort main processing, 52 ... Kanji additional field generation process, 6... Sort Kanji layer table, 7... Sort Kanji layer table management table, 21... Number of Kanji fields specified as sort keys, 221.231... Number of fields Position, 222.23
2...Number of characters, 223.233...Kanji order element, 311.321.331...Kanji code, 312.3
22,332... Kanji code collation order value, 411.421.431... Kanji order element, 412.
422,432...Identification name of sorted Kanji layer table 6 corresponding to Kanji order element, 501.502,503,504,505゜506.5
07.508...Processing step of sort main processing 51, 601.602, 603, 604, 605°606.6
07,608,609,610゜611.612...
Processing steps of kanji additional field generation processing 52. Figure 1

Claims (1)

[Claims] 1. A sort processing method using a Kanji field consisting of Kanji characters expressed by Kanji codes as a sort key, comprising a user program requesting sort execution, and the user program defining sort parameters. A sort parameter table for sorting, a sort work area used as a work area to execute sorting, and a shared software stored as shared software in the virtual storage area. A table for defining the magnitude relationship between Kanji codes, a sort processing means that provides Kanji order elements for Kanji fields, and a table that is stored as shared software in the shared software virtual storage area. A sorted kanji order table having a unique identifier, which is composed of a set of a code and a collation order value indicating the order value of the kanji of the kanji code according to the corresponding kanji order element, and the sorting processing means provides a sorted kanji order table management table consisting of a pair of kanji order elements and corresponding identifiers of the sorted kanji order table; The position and number of characters, the kanji order element for that key, and other parameters necessary for sorting are set in the sort parameter table, and control is passed to the sort processing means in the shared software virtual storage area, and the sort processing means: When control is passed from the user program, the sort main process is started, and the sort main process reads records to be sorted one by one into the sort work area, and each time a record is read, the kanji character is When the additional field generation process is called and control is returned to the sort main process, the order of the records is determined by comparing the kanji additional fields added to the records by the kanji additional field generation process, and the sort process is performed. In the kanji additional field generation process, the kanji order element for the kanji field specified in the sort parameter table is checked, and the identification name of the sorted kanji order table corresponding to the kanji order element is added to the sorted kanji order table. the position of the Kanji field specified in the sorting parameter table, with reference to the sorting Kanji order table implemented as shared software in the shared software virtual storage area, obtained from a management table and having its identification name; Starting from , the collation sequence value of the kanji code for each kanji in a range equal to the number of characters in that kanji field specified in the sort parameter table is added as a kanji additional field to the record input in the sort work area. A sorting method that uses the kanji field as the sort key.