JP3061486B2 - Data sort processing system - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a data sort processing system for processing a data string to be sorted in accordance with the size of an attribute value of the data, and more particularly to a data sort processing system capable of performing a high-speed sort processing. The present invention relates to a sort processing system.

2. Description of the Related Art In various fields of data processing, a process of sorting data strings according to attribute values such as data values and key values is performed. This sort processing requires a longer processing time as the number of data to be sorted increases. From now on, construction of a configuration that can execute the sorting process at high speed even when the number of data to be sorted becomes large is called for.

[0003]

2. Description of the Related Art Conventionally, when it is necessary to execute a sort process at high speed, first, a data string to be sorted is simply divided into a plurality of blocks, and the sort process is executed for each block. Then, by performing sort processing while sequentially comparing data between blocks, a method of realizing high speed according to a two-stage sort processing procedure of completing the entire sort processing has been adopted.

[0004]

However, such a conventional sort processing procedure has a problem that the processing time is still long.

[0005] The present invention was made in view of such circumstances, in the data sorting processing system for processing to sort according to the size of the attribute values with data rows of data, faster than the prior art The purpose of the present invention is to provide a new data sort processing system that realizes a simple sort process.

[0006]

FIG. 1 shows the principle configuration of the present invention. In the figure, reference numeral 1 denotes a data processing device provided with the present invention. The data processing device 1 includes a first developing unit 1
0, a table unit 11, a dividing unit 12, a second expanding unit 13, a sorting unit 14, a connecting unit 15, a third expanding unit 16, and a registering unit 17.

The first expanding means 10 expands a data string to be sorted. The data to be sorted which is developed has attribute values such as data values and key values. The table unit 11 manages a plurality of attribute values included in the attribute value range of the data string to be sorted. The dividing unit 12 divides the data sequence to be sorted by the first expanding unit 10 into a plurality of blocks by using the attribute values managed by the table unit 11.

The second expanding means 13 expands the data string to be sorted in units of blocks divided by the dividing means 12. The sorting unit 14 sorts the data of each block to be expanded by the second expanding unit 13 according to the size of the attribute value for each block. The linking unit 15 links the data strings to be sorted which are expanded by the second expanding unit 13.
The third expanding unit 16 expands the data string sorted by the connecting unit 15. The registration means 17 is a third developing means.
The previously sorted data string developed in column 16 is roughly the same.
Divided into multiple blocks with the same number of data
A function to specify the attribute value of data that separates blocks
Features and you register specified attribute values to tables means 11
Having .

[0009]

In the present invention, the registration means 17 divides the previously sorted data string developed by the third development means 16 into a plurality of blocks having substantially the same number of data, and stores the data of the data separating these blocks. The attribute value is specified, and the attribute value is registered in the table means 11.

[0010] When the attribute values are registered in the table means 11 in this manner, the dividing means 12 makes the first developing means 1
By comparing the attribute value of the data to be sorted this time, which is expanded to 0, with the attribute value managed by the table means 11, the data string to be sorted this time is divided into a plurality of blocks. The result is developed on the second developing means 13.

When the division result of the dividing means 12 is developed on the second developing means 13, the sorting means 14 sorts the data of each block developed by the second developing means 13 into the size of the attribute value for each block. , And this sorting means 1
When the sorting process by the sorting unit 14 is completed, the linking unit 15 converts the data of the blocks sorted by the sorting unit 14 into
By linking in the order of the management attribute values of the table unit 11 from which the blocks are generated, the sorting process of the data string developed by the first developing unit 10 is completed.

[0012] In this way, in the present invention, the last sort
Multiple blocks with approximately the same number of data
By dividing the data column into
The key layout for the
Is used to divide and sort the data column to be sorted this time
The sort processing is executed by connecting them.
Directly and easily, almost identical data
To be able to be divided into multiple blocks
In, it becomes possible to perform fast against the source preparative process.

[0013]

DESCRIPTION OF THE PREFERRED EMBODIMENTS The present invention will be described below in detail with reference to embodiments. FIG. 2 shows an overall processing flow of a sorting process performed by the data processing device 1 having the present invention.

As shown in this processing flow, the data processing apparatus 1 equipped with the present invention firstly performs step 1
Then, the registration processing by the registration means 17 is executed, then, in step 2, the division processing by the division means 12 is executed, and then, in step 3, the sorting processing by the sorting means 14 is executed. In step 4, by executing the linking process by the linking means 15, the sorting process of the data string to be sorted is realized.

FIG. 3 shows an embodiment of the detailed processing flow of the registration processing executed by the registration means 17, and FIG.
FIG. 5 shows an example of the detailed processing flow of the division processing executed by the sorting means 14, and FIG. 6 shows an example of the detailed processing flow of the sorting processing executed by the sorting means 14. 1 illustrates an example of a detailed processing flow. Next, the sort processing of the present invention will be described in detail according to these processing flows.

When a request to sort a data string to be sorted is issued, the registration unit 17 firstly, at step 1, interacts with the user to determine the number n of blocks, as shown in the processing flow of FIG. Set. Here, the number of blocks n can be fixedly set in advance. Next, in step 2, the previously sorted data string developed by the third developing means 16 is divided into n pieces, and the n
The attribute value of the data of the division point separating the individual is specified and registered in the table means 11.

In this manner, a plurality of attribute values included in the attribute value range of the previously sorted data string are registered in the table means 11 according to the processing of the registration means 17.

When the attribute value is registered in the table unit 11, the dividing unit 12 sets the attribute value as shown in the processing flow of FIG.
First, in step 1, n block entries set by the registration unit 17 in the second expansion unit 13 are generated. This block entry is to be associated with the attribute value managed by the table means 11, and is assigned a block number from 1 to n. Next, in step 2, the first expanding means 10
One of the first data (when passing through step 5, the next data after the previously read data) is read out from the data string to be sorted which is developed in (1).

Subsequently, in step 3, it is specified which zone the attribute value of the read data belongs to in the table means 11 under the attribute value. Subsequently, in step 4, the read data is stored in the block entry of the block number indicated by the specified zone. Then, in the following step 5, it is determined whether or not all of the data to be sorted developed in the first developing means 10 has been read out. If so, the process ends. By returning to step 2, processing for all data is executed.

In this way, according to the processing of the dividing means 12, the data to be sorted is sorted and stored in a plurality of block entries whose arrangement is determined.

When the data string to be sorted is divided into a plurality of blocks and developed by the second developing means 13, the sorting means 14 firstly performs the processing in step 1 as shown in the processing flow of FIG. , "1" is set to the variable i. next,
In step 2, the i-th block data pointed to by the variable i is sorted according to the size of the attribute value. Subsequently, in step 3, it is determined whether or not the value of the variable i has reached "n". When it is determined that the value has reached, the process ends. When it is determined that the value does not reach, the process proceeds to step 4. By incrementing the value of the variable i by one and returning to step 2,
Executes sort processing for all block data.

In this way, according to the processing of the sorting means 14, the data of each block developed by the second developing means 13 is sorted for each block according to the size of the attribute value.

When the block data expanded by the second expansion unit 13 is sorted in units of blocks, the linking unit 15 first executes the variable j in step 1 as shown in the processing flow of FIG. Is set to "1". next,
In step 2, the j-th block data pointed to by the variable j is expanded on the third expansion means 16 following the (j-1) -th block data stored previously. Here, the first block data is developed at a prescribed development position since it is the head. Subsequently, in step 3, it is determined whether or not the value of the variable j has reached "n". When it is determined that the value has reached, the process ends. When it is determined that the value does not reach, the process proceeds to step 4. By increasing the value of the variable j by one and then returning to step 2, the link processing of the n pieces of block data is executed.

In this way, according to the processing of the linking means 15, the sorting processing of the data string expanded in the first expanding means 10 is completed. Next, according to FIG.
The sorting process of the present invention will be specifically described.

As shown in the figure, the first expanding means 10 expands twelve data to be sorted using a data value as a sort key, and the table means 11 stores data values which are attribute values. It is assumed that “1”, “7”, “14”, “20” are registered.

For the data string to be sorted, the registration means 17 sets "3" as the number of blocks, and in response to the setting of the number of blocks, the dividing means 12 sets A, B, C
Generate three block entries identified by

Next, the dividing means 12 divides the data to be sorted from the first
When the data value of the read data is in the range of “1” to “7”, the data is stored in the block entry of A. When the data value of the read data is in the range of “8” to “14”, the block of B is read. Then, when the value is in the range of "15" to "20", the process of storing in the block entry of C is executed.

Subsequently, the sorting means 14 sorts the three block data of A, B and C according to the size of the data value for each block, as indicated by in the figure. continue,
The linking unit 15 converts the sorted block data into blocks A, B, and C as shown by in the figure.
In this order, these three block data are linked to complete the sorting of the data to be sorted which is developed in the first developing means 10.

Subsequently, as shown in the figure, the registering means 17 outputs "1" as a new data value to be registered in the table means 11 from the sorted data string developed by the third developing means 16. "6", "14", "20" are determined, and these data values are registered in the table means 11.

Although the illustrated embodiment has been described, the present invention is not limited to this. For example, in the embodiment,
By registering unit 17 divides the previous sorted data string to a data number of equal blocks it has been disclosed a structure to continue to determine the attribute value to be registered in the table means 11, exactly
It does not need to be equally divided into
It may be divided as follows.

[0031]

As described in the foregoing, in the present invention, previous <br/> sorted data sequence a plurality having an outline the same number of data
By dividing into blocks,
The key layout for split sorting is determined and the key
-Use an array to divide the data column
And sort them by connecting them
Use the sampling method.
Directly, multiple blocks with roughly the same number of data
Being able to split into locks allows fast sorting
Process and create a histogram.
Without using complicated methods such as
Can be divided into multiple blocks with roughly the same number of data
By becoming manner, it becomes possible to perform fast against the source preparative process.

[Brief description of the drawings]

FIG. 1 is a principle configuration diagram of the present invention.

FIG. 2 is an overall processing flow of a sorting process according to the present invention.

FIG. 3 is an embodiment of a processing flow executed by a registration unit.

FIG. 4 is an embodiment of a processing flow executed by a dividing unit.

FIG. 5 is an embodiment of a processing flow executed by a sorting unit.

FIG. 6 is an embodiment of a processing flow executed by a connection unit;

FIG. 7 is an explanatory diagram of the processing of the present invention.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 1 Data processing apparatus 10 1st development means 11 Table means 12 Division means 13 2nd development means 14 Sorting means 15 Connecting means 16 3rd development means 17 Registration means

 ──────────────────────────────────────────────────続 き Continuation of the front page (56) References JP-A-61-34626 (JP, A)

Claims (1)

(57) [Claims] The method according to claim 1] data sequence, a data sorting system for sorting according to size of the attribute value assigned to the data, the data string previously sorted into a plurality of blocks having the general same number of data divided and a specifying means for specifying the attribute values to delimit the block, and attribute value assigned to the data, by comparing the specified attribute value of the specific means, a data string to sort this plurality of blocks Dividing means for dividing the data of each block divided by the dividing means according to the magnitude of the attribute value for each block; and dividing the data of the blocks sorted by the sorting means into blocks. And a linking means for linking in order of the attribute values specified by the specifying means, which is the generation source of the data.