JPS62194535A - Symbol processor - Google Patents

Abstract

PURPOSE:To perform a matching process at high speed with the large quantity of symbol data by using an electronic circuit to form the extracting means of an adding part which add the symbol data to be matched when the coincidence is obtained between the key part of the symbol data to be matched and the matching symbol data after the comparison of both symbol data. CONSTITUTION:When a matching process instruction is supplied to a control circuit 9, a hash function arithmetic circuit 2 calculates the hash value of the key part of the symbol data to be matched to store it in a main memory circuit 4 together with the symbol data to be matched. When a matching request is delivered, the hash value of the matching symbol data is calculated and compared with the memory data to be matched and stored in the circuit 4 through a hash value comparator 6. If the coincidence is obtained from said comparison, the key part of the symbol data to be matched is compared with the matching symbol data through a symbol data comparator 7. When the coincidence is obtained from this comparison, the adding part of the symbol data to be matched is read out and stored in an output buffer memory circuit 8.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a symbol processing device that performs matching processing of symbol data in an information processing device.

[Conventional technology]

Conventionally, symbol data matching processing has been performed by a program in a general-purpose information processing device. The following two methods were the most common.

(1) Store the symbol data to be matched in an array with a constant length of elements in the main memory or external memory, and when a matching request is issued, sequentially retrieve the key part of the symbol data to be matched and create the matching symbol. The data is compared, and if they match, the additional part of the symbol data to be matched is extracted.

(2) Create an array with fixed element length in main memory or external memory, calculate the hash value of the key part of the symbol data to be matched, and place the symbol data to be matched at the position on the array indicated by the hash value. is stored, and when a matching request is issued, the hash value of the matching symbol data is calculated, and the key part of the symbol data to be matched stored at the position on the array indicated by the hash value is compared with the matching symbol data. If there is a match, the additional part of the symbol data to be matched is extracted.

[Problem that the invention seeks to solve]

The conventional symbol data matching process described above has two drawbacks: it takes a very long processing time when the amount of symbol data to be matched becomes enormous, and it is difficult to handle variable length symbol data.

[Means for solving problems]

The symbol processing device of the present invention receives and temporarily stores matched symbol data or matching symbol data consisting of a key part and an additional part in an input buffer memory circuit, and stores the matched symbol data in the input buffer memory circuit. The part or matching symbol data is cut to a certain width using a hash function calculation circuit and converted into a numerical value, and then 3 is calculated according to a certain composition rule.
The hash value obtained by the calculation and the symbol data to be matched are stored in a main memory circuit, and the hash value of the symbol data to be matched stored in the main memory circuit and the input buffer memory circuit are The hash value of the matching symbol data is compared with the hash value of the matching symbol data in the hash value comparison circuit, and when it is determined that the two hash values match, the key part of the symbol data to be matched stored in the main memory circuit and the input buffer memory are The matching symbol data of the circuit is compared with the symbol data comparison circuit, and if it is found that both symbol data match, the additional part of the matched symbol data stored in the main memory circuit is extracted. Temporarily stored in the output buffer storage circuit.

〔Example〕

Next, the present invention will be explained with reference to the drawings.

FIG. 1 shows an embodiment of the invention. The input buffer storage circuit 1 is connected to a hash function calculation circuit 2, a symbol data write circuit 3, and a symbol data comparison circuit 7, and the hash function calculation circuit 2 is connected to a symbol data write circuit 3 and a hash value comparison circuit 6. The symbol data write circuit 3 is connected to the main memory circuit 4, and the symbol data read circuit 5 is connected to the main memory circuit 4, and the symbol data read circuit 5 has a hash value comparison circuit 6, a symbol data comparison circuit 7, and an output buffer memory circuit. 8, the hash value comparison circuit 6 is connected to the symbol data comparison circuit 7, the symbol data comparison circuit 7 is connected to the output buffer storage circuit 8, and the control circuit 9 is connected to the hash function calculation circuit 2 and the symbol data comparison circuit 7. 3 input circuit 3, symbol data A"C output circuit 5, hash value comparison circuit 6, and symbol data comparison circuit 7 are used.

Next, the operation of this invention will be explained.

First, when the control circuit 9 receives an instruction to input symbol data to be matched, the symbol data to be matched is stored in the input buffer storage circuit 1. The key part of the symbol data to be matched is cut out at a certain width in a hash function calculation circuit 2, converted into a numerical value, and calculated according to a certain calculation rule.

FIG. 2 shows an example of the hash value calculation process in the hash function calculation circuit 2. In the case of the JIS code, the key part 10 of the symbol data to be matched inputted in FIG. , when this is evolved by 10, the value after 10 evolution becomes 13, and by adding these up, the Hanosoyu value of 14 is obtained.

The Hanonyu value and symbol data obtained by the total 1γ are written into the main memory circuit 4 by the symbol data writing circuit 3 and stored. This series of operations continues until there is no symbol data to be matched.

FIG. 3 shows the state of the main j17 circuit 4. In other words, the hash value of each symbol data to be matched is 15 for each word.
Starting with 16 characters in the key part of symbol data, 17 characters in the key part of symbol data, 18 characters in the appended part of symbol data, and 19 characters in the appended part of symbol data are sequentially stored.

Next, when an instruction to perform a matching process is input to the control circuit 9, new matching symbol data is stored in the input/output buffer storage circuit 1. The inputted matching symbol data is sent to the zero-order symbol data readout circuit 5 where the hash value is calculated by the hash function calculation circuit 2 in the same way as the symbol data to be matched.
As a result, the hash value 15 of the symbol data to be matched stored in the main memory circuit 4 is successively output and compared with the hash value of the symbol data to be matched by the hash value comparison circuit 6. This operation is repeated when the two hafsh values do not match. - When defeated, the symbol data reading circuit 5 reads out the key part 17 of the symbol data to be matched stored in the main memory, and the symbol data comparison circuit 7 compares it with the matching symbol data. When the two symbol data do not match, the process returns to the operation of reading the Hanonyu value of the symbol data to be matched. - When the symbol data reading circuit 5 loses, the appended portion 19 of the symbol data to be matched stored in the main memory circuit 4 is read out and stored in the output buffer memory circuit 8. If matching symbol data does not exist, the control circuit 9 outputs a signal to that effect.

〔Effect of the invention〕

As explained above, the present invention calculates the hash value of the key part of the symbol data to be matched, stores it in the main memory circuit together with the symbol data to be matched, and when a matching request is issued, the hash value of the key part of the symbol data to be matched is calculated. , and compares the hash value of the matching memory data stored in the main memory circuit with the matching symbol data, and when they match, further compares the key part of the matching symbol data with the matching symbol data, By implementing a series of means using electronic circuits to extract the additional part of the symbol data to be matched when these match, it is possible to match a large amount of symbol data at high speed, and also to match variable length symbol data. This has the effect that it can be easily handled.

[Brief explanation of drawings]

FIG. 1 is a block diagram showing an embodiment of the present invention, FIG. 2 is a diagram showing an example of the hash value calculation process in the hash function calculation circuit 2 of FIG. 1, and FIG. 3 is a block diagram showing the above jI2 circuit of FIG. 1. 4 is a diagram showing a storage example of No. 4. FIG. ■...Input/output buffer memory circuit, 2...Hash function calculation circuit, 3...Symbol data 1 inclusion circuit, 4...Main memory circuit, 5...Symbol data reading circuit, 6... Hash value comparison circuit, 7... Symbol data comparison circuit, 8...
・Output cuff 1 jj'r memory circuit, 9...control circuit, 1
0...Key part of symbol data to be matched and matching symbol data, 11...Bit configuration of JIS code,
12... Dot configuration after hash, 13... Numerical value after decimal conversion, 14... Hash value, 15... Hash value, 16... Number of characters in key part of symbol data to be matched, 17 ...Key part of symbol data to be matched,
18...Number of characters in the additional part of the data to be matched,
19...77 digit symbol data (1 part. Figure 2 Figure 3

Claims (1)

[Claims] (1) An input buffer memory circuit that receives and temporarily stores the symbol data to be matched or matching symbol data consisting of a key part and an additional part, and the key part or matching of the symbol data to be matched in the input buffer memory circuit. a hash function calculation circuit that cuts symbol data to a certain width, converts it into a numerical value, and calculates it according to a certain calculation rule; and a value obtained by the hash function calculation circuit regarding the symbol data to be matched and the symbol data to be matched. (hereinafter referred to as hash value)
a hash value comparison circuit that compares a hash value of the matching symbol data stored in the main memory circuit with a hash value of the matching symbol data input to the input buffer memory circuit; , If the hash value comparison circuit determines that the two hash values match, compare the key part of the symbol data to be matched stored in the main memory circuit with the matching symbol data in the input buffer memory circuit. and a symbol data comparison circuit that extracts the additional part of the matched symbol data stored in the main memory circuit when it is determined by the symbol data comparison circuit that the symbol data matches, and temporarily and an output buffer storage circuit for storing.