JPS583033A - Tree structure retrieval processor - Google Patents

Abstract

PURPOSE:To reduce a mean number of times of access, by converting an unbalanced tree structure to a balanced tree structure, constituting a tree structure storage information storing part, and converting and accessing the code sequence of a code train to be retrieved. CONSTITUTION:In an address AO, information FO containing a key information, a branch information, etc. is stored, and also a left pointer A1 and a right pointer A2 showing a left branch or a right branch in accordance with an upper rank part of a post-conversion code train which has been converted by a code sequence converting circuit part 10, and a branch information in the information F0 are stored. When contents of the address A0 have been read out by a data register 3, the key information in the information F0 is compared with the upper rank part of the code train by a branch deciding circuit part 5. this result is in coincidence, and also a gate or a gate 8 is turned on by the branch information in the information F0. By the pointer, contents of each address in an information storing part 1 are read out by the data register 3, and comparison and branch decision are repeated.

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention provides a tree structure search processing device, particularly a tree structure search processing device that accesses a tree structure storage information storage section and extracts output information based on a predetermined code string.
A tree structure storage information storage unit is constructed by converting the code order in the predetermined code string in the correspondence between the predetermined code string and the output information, and the code string is searched upon access. The present invention relates to a tree structure search processing device that reduces the number of searches by converting the code order of the tree structure information storage unit to search the tree structure storage information storage unit.

Conventionally, 2. For example, when there is a correspondence relationship between the ':I-code string and the output information (contents) as shown in the first diagram corresponding to a predetermined code string, the above code string is input. In the search processing 31 device that extracts output information, the above correspondence relationship is a tree structure as shown in FIG. , #A method of searching the information storage section is adopted.

That is, conventionally.

For example, the correspondence relationship shown in FIG. 1 (4) is circled so that the tree structure is taken into account and the tree structure storage information storage unit is configured, so to speak.

However, when an information storage unit is configured with a tree structure as shown in Figure 1 (B1), the number of accesses to the information storage unit is generally large because the tree structure is greatly unbalanced. .

For example, suppose that in the tree structure shown in Figure 1 (B1), node H needs to be accessed one more time to obtain output information after it is found in the tree structure shown in Figure 1 (B1). 5.3 on average to extract the output information
This will require 75 times.

The present invention aims to solve the above-mentioned problems.
Configure a tree structure storage information storage unit by converting a given unbalanced tree structure into a tree structure that is as balanced as possible,
It is an object of the present invention to provide a tree structure search processing device that converts the code order of a code string to be searched for access. Therefore, the tree structure search processing device of the present invention provides key information and one key information corresponding to each node.
One or more pointers are set and the output information is stored in a log structure, and each code of the code string based on multiple key codes is compared with the key information set corresponding to the above node. In the tree structure search processing device that extracts the output information, the tree structure storage information storage stores the key information and the pointer based on a tree structure in which the order of the codes to be output into a predetermined code string is converted. and a code order converting section for converting the origin of the codes in the predetermined code string, and the above-mentioned tree structure storage information storage section is provided based on the code order converted by the code order converting section. It is characterized by being accessed sequentially. This will be explained below with reference to the drawings.

FIG. 2 is an explanatory diagram illustrating how a balanced tree structure is obtained by converting the code order of a code string according to the idea of the present invention, and FIG. 3 is an information storage unit that stores the tree structure shown in FIG. 1 (B). FIG. 4 is an example of a conventional tree structure search processing device having a tree structure shown in FIG.
C1 shows an explanatory diagram illustrating another aspect of obtaining a balanced tree structure.

When obtaining output information based on a predetermined code string in a tree structure search processing device.

It is sufficient that the obtained output information and the input code string are correctly correlated. Focusing on this point, the first
Even if the correspondence between a code string and output information (content) as shown in the inverted diagram is predetermined, the codes in the code string are converted so that a balanced tree structure is obtained when expanded into a tree structure. It is free to rearrange the tree structure in a round shape and store it in the information storage unit.

The tree structure shown in FIG. 2 is constructed by reversing the code order of the code string shown in the first inversion and associating it with output information. That is, seven nodes (white circles in the diagram) are prepared that have only one branch information and do not include key information, and the codes at the end of the code string shown in the first position are rAJ and rBJ.

. . . Depending on which rHJ it is, it is directly correlated with the output information. , By using this tree structure, the entire tree structure becomes a balanced shape,
Output information can be extracted by accessing an average of five times.

FIG. 3 shows an example of a conventional tree structure search processing device having an information storage section that stores the tree structure shown in FIG. 1(B). The code 1 in the figure is a tree structure storage information storage unit, AOIAI
+..., Nl, N2.・・・・・・＋Q'
+Q 2r... is the address, 2 is the access address register.

3 is a tree structure search data register, 4 is an output information extraction data register, FO, Fl, ..., F1'
.

F2', . . . are information including branch information and information indicating the type of node, etc., and 5 is a branch judgment circuit section which reads out the code and information of the code string to be searched from the information storage section 1. 6 is a gate control circuit unit which issues a control output based on the determination result by the branch determination circuit unit 5. , 7.8 represent gates, and 9 represents an OR circuit.

In the information storage unit 1, there is a tree structure search information storage area (
AO,,AI,...,N1. N2.・・・・・・
) and an output information storage area (Ql, Q2... songs), so that it can be determined whether the read data is set in data register 3 or data register 4 depending on the address IK. is taken into consideration.

As will become clear when associated with the tree structure shown in FIG. 1 (IB), for example, address AO has address AI K for a left branch as shown in FIG. K Pointer 1 indicating what to proceed to
-0.1-1 and information F including key information, branch information, etc.
O is stored. Note that 1-2 in the figure is information indicating the type of node, etc., and is included in the information FI4-Fi'.

Now suppose that the search code string [A GJ is given,
Fixed address information AO is set in Atbis register 2, and the contents of address AO are read out to data register 5. At this time, register isK! ! The feelings expressed @
The key information of the FO and the first code "person" of the search code string jAGJ are compared by the branch determination circuit unit 5.

Based on the result that they match and the branch information in the information FO, the left branch gate 7 is turned on and the pointer value A1 is set in the address register 2. As a result, the contents of address A1 of information storage section 1 are read to register 3. Then, the key information in the information F1 and the search code string are compared, and the gate 8 is turned on based on the fact that they match and that the branch information in the information F1 indicates a right branch. The pointer value N2 at this time is set in the address table register 2.

Output information Q2 is read from address N1, and finally content P6 of address Q2 is read to data register 4.

FIG. 4 shows an embodiment of a tree structure search processing device according to the present invention, which stores the tree structure shown in FIG. Codes 1, 2, 5, 4, 5, 6°7.8, 9 in the figure. A
O,AI,...,N1. N2.・・・・・・、
Ql, Q2°, . . . correspond to those shown in FIG. 1, and 10 indicates a code order conversion circuit section.

In the illustrated case, for example, in address person 0, information FO including branch information among key information is stored.

A left pointer A indicating whether to branch to the left or to the right based on the upper part of the converted code string converted by the code order conversion circuit s10, the branch information in the information FO, and K.
1 and right pointer A2 are stored. Note that AO, AI, . . . , QB shown in FIG. 2 are addresses AO, AI, . . . in the information storage unit 1 shown in FIG.
..., it corresponds to QB 〇 Now, let's say that the search code string [
When AGJ is input, fixed address information AO is set in address register 2, and the contents of address AO are read out to data register 3. On the other hand, the input search code string [A GJ is converted into the code string [GAJ] by the code order conversion circuit section 10
is supplied to

When the contents of the address AO are read to the data register 5, the 1-branch determination circuit section 5 compares the key information in the information FO with the upper part of the code string "GAJ."

As a result, a right branch is determined based on the branch information in Sho-katsu-jo@FO, and gate 8 is turned on. Then, pointer value A2 is set in address register 2, and the contents of address person 2 in information storage section 1 are set in data register 3.
is read out. The key information F1 read at this time and the search code string are compared and they match. and information F1
A right branch is taken based on the branch information in the information storage section 1.
The contents of address A6 are set in data register 5. Address A6K is matched by the key information in the corresponding information 'P6, and a left branch is taken based on the branch information in the information F6.

And the content Q of address N7 in information storage 1111
7 is set in data register 4 as output information. Finally, the content P6 of address Q7 is read to data register 4.

FIG. 5 (Al (Bl (C1) shows an explanatory diagram for explaining another aspect of obtaining a parsed tree structure.

Figure 5) The case of the correspondence between the illustrated code string and the output information (content) is developed as it is into this structure.

It becomes as shown in FIG. 5(B). When stored in the 11 information storage section in this state, an average of 4.
It requires 25 accesses.

However, by rearranging the 5th country code string in reverse order, a balanced tree structure like the one shown in Figure 5 (C1 kuji) can be obtained.

It becomes possible to obtain a search processing device that can be accessed four times on average.

Note that the manner in which the code order of the code string is converted is not limited to the above example, and is arbitrary as long as the conversion in the code order conversion circuit section 10 is not difficult. For example, code 0
．． 1, 2. ...as expressed by river →.

Prisoner (5, 6, 7, 8, 9), (0, 1, 2, 3, 4)
Something like.

(Bl (A + S + 6) + (Or 1
Something like p 2 e 3) + (7T 819).

(C1 (9, 8, 7, 6, 5), (0, 1, 2, 5, 4
) Something like.

(D) (4,5,6), (0,1,2,3), (9,8
, 7).

(El (1,0)+ (3,2), (5,4),
Things like (716) and (918).

Kimono.

(Gl (8t6+'+LD)+(1,315,7,
9) Something like.

etc. is optional.

As explained above, according to the present invention, even if the correspondence between a given code string and output information is an extremely unbalanced tree structure, the concept of converting the code order of the code string is possible. By introducing , the log structure can be made as balanced as possible, and the average number of accesses can be reduced.

In addition, if there is a possibility that a predetermined code string will be searched with a high S+* compared to other K, an unbalanced tree structure may be preferable, and an information storage section with multiple types may be preferable. You are also free to prepare and select K.

[Brief explanation of the drawing]

FIG. 1 is an explanatory diagram for explaining the prerequisite problem of the present invention. FIG. 2 is an explanatory diagram illustrating how a balanced tree structure is obtained by converting the code order of a code string according to the idea of the present invention, and FIG. 5 shows an information storage unit storing the tree structure shown in FIG. An example of a conventional book structure search processing HA device, Part 4
The figure shows the configuration of an embodiment of the tree structure search processing device of the present invention, which stores the tree structure shown in FIG.
) shows an explanatory diagram illustrating another aspect of obtaining a balanced log structure. In the figure, 1 is a tree-structured information storage section, 2 is an access address register, 3 and 4 are data registers, 5 is a branch judgment circuit section, 6 is a gate control circuit section, and 10 is a code order conversion circuit section. represents. Patent applicant Hiroshi Mori, agent patent attorney of Fujitsu Ltd.

Claims (1)

[Claims] Output information is stored in a tree structure in which key information and one or more pointers are set corresponding to nodes, and each code of a code string based on a plurality of key codes is In the tree structure search processing device that extracts the above output information while comparing it with the key information set corresponding to the node, the above output information is extracted based on the tree structure in which the order of the hoods in the predetermined nine code strings is converted. A tree structure storage information storage section storing key information and the pointer is provided, and a code order conversion section is provided for converting the order of codes in the predetermined code string. A tree structure search processing device characterized in that the tree structure storage information storage section is sequentially accessed based on the code order converted by the code order conversion section.