JPH0793129A - Sort system - Google Patents

Abstract

PURPOSE:To improve the sort efficiency. CONSTITUTION:A retrieval inserting means successively searches a data address part 201 and retrieves a rough position to insert additional data by referring to a data storage part 101 instructed by an address stored in the data address storage part 201. Next, the data inserting position is decided by referring to the data storage part 101 instructed by an address stored in a next data address storage part 102 successively from this rough position, the additional data are inserted, and the value of an additional data counter 202 corresponding to the rough position is counted up. When the value of this additional data counter 202 reaches a previously decided value, a second storage part generating means successively draws in the addresses stored in the next data address storage part 102 at the rough position, this drawn-in address is stored in the data address storage part 201 for every previously decided number, and the additional data counter 202 is initialized.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a data sorting system, and more particularly to a sorting system using an insertion method.

[0002]

2. Description of the Related Art In a conventional method, sorting is realized by configuring data, a pointer pointing to data smaller than the data, and a pointer pointing to large data in a binary tree (binary tree) form. . (Please refer to the information processing handbook etc. for the binary tree.)

The above-mentioned conventional sorting method has a drawback that the sorting efficiency becomes poor if the tree is not symmetrical.

[0003]

According to a first aspect of the present invention, in a data sorting system, a data storage unit for storing data and an address for the next data of the data arranged in a predetermined order are stored. Data for storing a first storage unit having a plurality of first sets each comprising a data address storage unit and the first sets selected for each predetermined number and storing the addresses of the selected first sets An address storage unit and a second storage unit having a plurality of second sets of additional data counters for storing the number of additional data, and the data address storage unit is searched in order and stored in the data address storage unit. The first as a general position for inserting the additional data by the first algorithm determined in advance by referring to the data storage unit in the first set pointed to by the stored address A set is searched, and then a second algorithm predetermined with reference to the data storage unit pointed to by the address stored in the next data address storage unit in order from the first set as the rough position A search insertion means for determining a data insertion position, inserting the additional data, and counting up the value of the additional data counter in the second set corresponding to the first set as the general position. And

According to a second aspect of the present invention, when the value of the additional data counter reaches a predetermined value, the addresses stored in the next data address storage unit are sequentially traced from the first set as the rough position in advance. It is characterized by further comprising a second storage unit generating means for storing the first set of addresses in the data address storage unit for each predetermined number and initializing the additional data counter.

[0005]

Embodiments of the present invention will now be described with reference to the drawings.

FIG. 1 is a block diagram showing an embodiment of the present invention.

The first storage unit 100 is provided with a plurality of sets of a data storage unit 101 for storing data and a next data address storage unit 102 for storing an address to the next data.

The second storage unit 200 includes a data address storage unit 201 for storing an address to data and an additional data counter 20 for storing the number of additional data.
A plurality of groups of 2 are provided.

First, the search / insertion means 300 refers to the data storage unit 101 pointed to by the address stored in the data address storage unit 201 to search for a rough position for inserting additional data. Next, next data address storage unit 1
Data storage unit 1 pointed to by the address stored in 02
With reference to 01, the insertion position is searched in detail. When the insertion position is determined, the address of the next data address storage unit 102 is changed and the additional data is inserted. At this time, the additional data counter 202 also counts up.

When the value of the additional data counter 202 reaches a predetermined value, the second storage section generating means 400 sequentially traces the next data address storage section 102 and stores the data in the data address storage section 201 at predetermined intervals. The data address is stored and the additional data counter 202 is initialized.

2 and 3 show the first storage section 10 of FIG.
3 is a diagram specifically showing details of the relationship between 0 and the second storage unit 200. FIG. FIG. 2 shows data 10, 20, ..., 70 and 80.
Is stored in ascending order. FIG. 3 shows a state in which the additional data 51 is inserted in FIG. FIG. 4 is a flow chart showing the procedure of the sorting method of FIG.

FIG. 3 is obtained by adding 51 data to the state of FIG.
The case of setting the state will be specifically described with reference to FIG.

The search insertion means 300 uses the data 10 in the data storage unit 101 pointed to by the address stored in the first data address storage unit 201 as comparison data (step 1). It is checked whether the comparison data is larger than the additional data 51 (step 2). Since the comparison data 10 is smaller than the additional data, the comparison data 10 is used as the pre-comparison data, and the data is moved to the second data address storage unit 201 (step 3). The data 40 is similarly repeated, and the comparison data 40 is also set as the pre-comparison data (steps 1 to 3). The third data 70 is compared (step 1). It is checked whether the comparison data 70 is larger than the additional data 51 (step 2). Since the comparison data 70 is larger than the additional data 51, the additional data counter 202 pointing to the previous comparison data 40 is incremented by 1 (step 4). The data 50 in the data storage unit 101 pointed to by the address stored in the next data address storage unit 102 of the previous comparison data 40 is used as comparison data (step 5). Since the comparison data 50 is not larger than the additional data 51, the comparison data 50 is used as the pre-comparison data (step 7). The data 60 in the data storage unit 101 pointed to by the address stored in the next data address storage unit 102 of the previous comparison data 50 is used as comparison data (step 5). Since the comparison data 60 is larger than the additional data 51, the additional data 51 is inserted after the previous comparison data 50 (step 8).

Of the above procedures, the operations of steps 1 to 3 can be speeded up by a binary search.

As described above, when the insertion of additional data is repeated, the operations of steps 5 to 7 increase, and the search time increases. This increase is due to the additional data counter 202
To deal with by increasing the number of. That is, when the value of the additional data counter 202 reaches a predetermined value,
The second storage unit generating means 400 stores data addresses in the data address storage unit 201 at predetermined intervals while sequentially tracing the next data address storage unit 102, and initializes the additional data counter 202.

[0016]

As described above, according to the present invention, the sorting data is searched at a specific interval to determine a rough sorting position, and sorting is performed within the range, so that the non-tree type data is sorted. This has the effect of improving the sorting efficiency even for a data structure that is sequentially arranged in the order of the size of the value. In particular, there is an effect that the search interval can be optimally selected according to the data structure.

[Brief description of drawings]

FIG. 1 is a block diagram showing an embodiment of the present invention.

FIG. 2 is an explanatory diagram showing an example of the operation of the present embodiment.

FIG. 3 is an explanatory diagram showing an example of the operation of the present embodiment.

FIG. 4 is a flowchart showing a procedure of a sorting method of this embodiment.

[Explanation of symbols]

 100 first storage unit 101 data storage unit 102 next data address storage unit 200 second storage unit 201 data address storage unit 202 additional data counter 300 search insertion unit 400 second storage unit generation unit

Claims (2)

[Claims] 1. A first set of data sorting methods, comprising a data storage unit for storing data and a next data address storage unit for storing the address of the next data of the data arranged in a predetermined order. A first storage unit including a plurality of sets, a data address storage unit that stores the addresses of the selected first set by selecting the first set by a predetermined number, and stores the number of additional data A second storage unit having a plurality of second sets of additional data counters, the data address storage unit is sequentially searched, and the first address pointed to by the address stored in the data address storage unit is indicated. The first set is searched as a rough position for inserting the additional data by a first algorithm predetermined with reference to the data storage unit in the first set, and then the rough position is searched. From the first set, the data storage position pointed to by the address stored in the next data address storage unit is pointed to, and the additional data is determined by the second algorithm determined in advance. And a search / insert means for counting up the value of the additional data counter in the second set corresponding to the first set as the rough position. 2. When the value of the additional data counter reaches a predetermined value, the addresses stored in the next data address storage unit are sequentially traced from the first set as the rough position, and for each predetermined number. 2. The sorting method according to claim 1, further comprising a second storage generating unit that stores the first set of addresses in the data address storage and initializes the additional data counter.