Method and apparatus for searching data

Abstract: A special-purpose hardware and a method for data searching in a dababase or in file processing is disclosed for searching data which is flexible with regard to a change in data length. Therefore, as a means for realizing expansibility for a change in data length, it is considered to divide the data every certain fixed number of bits (every m-th bit) and then to process the divided data. Concretely, this becomes an arrangement in which a plurality of processors each processing the m-bit data are connected. A change in the data length can be coped with by altering the connected number of processors. In this case, it is required to exchange information among the processors, and the quantity of the exchange information needs to be rendered small. The present invention is so constructed that the processor processing certain m bits receives input information from only the processor processing immediately upper m bits and delivers output information to only the processor processing immediately lower m bits.

Description: Field of the Invention: The present invention relates to special-purpose hardware and a method which execute data searching in a database or in file processing, and more particularly to a method and an apparatus for searching data which is flexible with regard to a change in data length. Description of the Prior Art: As database-oriented hardware for searching data, there is known a heap sort type engine proposed by the inventors (Tanaka, Y. et al: Pipeline Searching and Sorting Modules as Components of a Data Flow Database Computer, IFIP Congress '80, pp. 427-432, Oct. 1980). This engine can completely overlap the transmission and sorting calculation of data, and can therefore perform a very efficient computation. This engine, however, has been problematic in the following points: (1) Due to complicated circuitry, the number of elements is too large and poses a problem in LSI implementations. (2) There is no expansibility for an alteration in the data length. Another sorting engine is known which is a merge sort type engine (Todd, S.: Algorithm and Hardware for a Merge Sort Using Multiple Processors, IBM J.Res.Develop., Vol. 22, No. 5, May 1978). Since the merge sort is simpler in the calculative system than the heap sort, it can simplify hardware, but it has not solved the above problem (2). Summary of the Invention: In view of the above circumstances, the present invention consists in building an engine for searching which is flexible to a change in the data length, and it has for its object to provide a method and an apparatus for searching which meet the requirement of simplifying circuitry to the utmost in order to permit LSI implementation. In accordance with the present invention, this object is solved, with regard to the method, by the features described in claim 1; and with regard to the apparatus, by the features described in claim 4. Preferred embodiments of the method given in claim 1 are included in subclaims 2 and 3, and a preferred embodiment of the apparatus given in claim 4 is included in claim 5. Therefore, as a means for realizing expansibility for a change in data length, it is considered to divide the data every certain fixed number of bits (every m-th bit) and then to process the divided data. Concretely, this becomes an arrangement in which a plurality of processors each processing the m-bit data are connected. A change in the data length can be coped with by altering the connected number of processors. In this case, it is required to exchange information among the processors, and the quantity of the exchange information needs to be rendered small. The present invention is so constructed that the processor processing certain m bits receives input information from only the processor processing immediately upper m bits and delivers output information to only the processor processing immediately lower m bits. Brief Description of the Drawings: Figs. 1(a) and 1(b) are flow diagrams showing the searching process of a searching engine according to the present invention; Figs. 2(a), 2(b), 2(c) and 2(d) are diagrams for explaining the transition states of the searching process of the present invention; Fig. 3 is a diagram showing a method of inputting a search key to the searching engine of the present invention; Fig. 4 is an arrangement diagram of a bit sliced searcher; Fig. 5 is an arrangement diagram of a control circuit within the bit sliced searcher; and Fig. 6 is a diagram for elucidating a case of handling variable-length data by means of the bit sliced searcher. Detailed Description of the Preferred Embodiment: Next, an embodiment for searching will be described. A searching engine performs a collective searching process. Key words which are data to be searched are arrayed in the ascending order or in the descending order. The key words are stored as the structure of a left shift binary tree (hereinbelow, abbreviated to 'LSBT') (refer to, for example, the first-mentioned literature). The searching process termed here signifies that the key words are stored as the LSBT structure beforehand, that the operations between the LSBT and a search key are executed, and that the range of addresses which store the key words agreeing with the search key is found. Figs. 1(a) and 1(b) are diagrams for explaining the searching process of the searching engine. The searching engine stores the key words in the form of the LSBT structure as shown in Fig. 1(a). The key words are stored at the respective levels of the LSBT as follows. '32' is stored at the first level, '30' and '50' are stored at the second level, and '23', '31', '36' and '71' are stored at the third level. The searching process of the searching engine is started from the root node of the LSBT, namely, the first level in Fig. 1(a) and proceeds to the leaf nodes, to consequently find the range of memory bank addresses having the key words equal to the search key. In Fig. 1(a), the courses along which the LSBT is traced in the searching process when the search key is '31' are indicated by solid lines and broken lines. The solid lines indicate a process for obtaining the least one of the memory bank addresses which have the key words fulfilling the relation of being larger than or equal to the search key, while the broken lines indicate a process for obtaining the least one of the memory bank addresses which have the key words fulfilling the relation of being larger than the search key. In Fig. 1(a), the key words (23, 30, 31, 32, 36, 50, 71) are stored in the ascending order in the order in which the smaller address precedes. As regards the solid lines, the key word 32 of the first level and the search key 31 are compared, with the result that the left side of the LSBT is traced because the search key is smaller. Subsequently, the key word 30 of the second level and the search key 31 are compared, with the result that the right side of the LSBT is traced because the search key is larger. Lastly, the key word 31 of the third level and the search key 31 are equal, so that the left side of the LSBT is traced. Then, the process ends. As a result, the LSBT has been traced at the left, right and left. When '0' is caused to correspond to the left and '1' to the right, it is understood from address 010 2 (= 2) that the key word equal to the search key is stored. This address is called the left boundary. Likewise, as regards the broken lines, the key word 32 of the first level and the search key 31 are compared, with the result that the left side of the LSBT is traced because the search key is smaller. Subsequently, the key word 30 of the second level and the search key 31 are compared, with the result that the right side of the LSBT is traced because the search key is larger. Lastly, the key word 31 of the third level and the search key 31 are equal, so that the right side of the LSBT is traced unlike the case of finding the left boundary. Then, the process ends. As a result, the LSBT has been traced at the left, right and right. When '0' is caused to correspond to the left and '1' to the right, it is understood from address 011 2 (= 3) that the key word larger than the search key is stored. This address is called the right boundary. The left boundary fulfills the property that it is larger than or equal to the right boundary. Thus far, there has been described the example in which two-digit numerals are the objects of the searching process. Now, an example which realizes the searching process by the use of bit sliced searchers is illustrated in Fig. 1(b). When two-digit numerals are subjected to one-digit numeral bit slicing, two bit sliced searchers are used. In the first slice, key words (2, 3, 3, 3, 3, 5 and 7) are stored in the order of addresses, while in the second slice, key words (3, 0, 1, 2, 6, 0 and 1) are stored in the order of the addresses. A search key 31 is also subjected to the one-digit numeral bit slicing, and 3 and 1 are respectively input as search keys in the first slice and the second slice. In both the slices, the search process starts from a first level and ends at a third level and determines a left boundary and a right boundary. With the bit sliced searchers, the comparison of the first level of the second slice needs to be processed using the calculated result of the first level of the first slice. In general, the calculated result of the ℓ-th level of the k-th slice needs to be used for processing the comparison of the ℓ-th level of the (k + 1)-th slice. The range between the left boundary and the right boundary determined with the first slice has the feature that, at the same level, it is wider than the range between the left boundary and the right boundary determined with the second slice. This is understood from the fact that the hatching parts of the second slice in Fig. 1(b) indicate the left boundary and the right boundary of the first slice and that the left boundary and the right boundary of the second slice exist within an area enclosed with the hatchings. Next, there will be explained means for determining the searching course of the second slice by the use of the searching course of the first slice. First, a procedure for finding the left boundary will be explained. Let's consider four cases as the searching process. Case X L : The left boundary and right boundary of the first slice and the left boundary of the second slice are in agreement. Case L L : The left boundary of the first slice and the left boundary of the second slice are in agreement, and the right boundary of the first slice is greater than the two. Case N L : The left boundary of the first slice, the left boundary of the second slice and the right boundary of the first slice are greater in the order mentioned. Case R L : The right boundary of the first slice and the left boundary of the second slice are in agreement, and the left boundary of the first slice is smaller than the two. Control information which is transmitted from the first slice to the second slice is information CO L which indicates at each level that the left boundary of the first slice has moved leftwards or rightwards. The information CO L assumes {0, 1}, and it becomes '0' in the case of the leftward movement of the left boundary and '1' in the case of the rightward movement. These control information items are also used for creating memory bank addresses storing the key words which are compared in order to determine the left boundary and the right boundary at the next level in each slice. In addition, the moving direction of the left boundary of the first slice is denoted by CI L , and that of the right boundary of the first slice by CI R . Information COND L assumes a truth value which indicates that the key word is greater than or equal to the search key or that the left boundary is greater than the address storing the key word. The information CO L is determined from the above four inputs; the searching process {X L , L L , N L , R L }, CI L , CI R and COND L . The state transition diagram is shown in Fig. 2(a). In the same way, control information CO R indicative of the movement of the right boundary is determined. The state transition diagram is shown in Fig. 2(b). Lastly, the state transition of the searching process will be considered in order to grasp the searching process of the first slice with the second slice as to the same level. When the state of the searching process for determining the left boundary is paired with the state of the searching process for determining the right boundary, the following seven combinations exist: The searching process starts at the first level with (X L , X R ) as an initial state. Fig. 2(c) shows a state transition diagram of the searching process of the left boundary, while Fig. 2(d) shows a state transition diagram of the searching process of the right boundary. The above searching course can be expressed with two automatons each having four inputs, and can afford the searched result. While the example has referred to the searching engine of the LSBT construction of three levels composed of the two bit sliced searchers, a searching engine of the LSBT construction of ℓ levels can be similarly realized using k bit sliced searchers. Fig. 3 illustrates a method of inputing a search key to the searching engine of the present invention. In Fig. 3 bit sliced searchers numbering (k + 1) are comprised. Here, the searcher which executes the searching process of the m bits of the uppermost digit of the search key is called the modified bit sliced searcher 20 (hereinbelow, abbreviated to 'MBSE 20'), while the searchers other than the MBSE 20, each of which executes the searching process of the corresponding m bits of the search key are called the bit sliced searchers 21 (abbreviated to 'BSEs 21'). The bit sliced search key which is input to each searcher is called an input stream, while address information which is output from each searcher is called an output stream. In this regard, the MBSE 20 receives an input stream 0 and delivers an output stream 0, the BSE 21-1 receives an input stream 1 and delivers an output stream 1, and thenceforth, the BSE 21-k receives an input stream k and delivers an output stream k. Regarding the MBSE 20, symbol DT 22 denotes a port for inputing the most significant m bits (input stream 0) of the search key, symbol LB 36 a port for outputing the least one of memory bank addresses which store key words fulfilling the relation of being equal to or larger than the search key, and symbol RB 37 a port for outputing the least one of memory bank addresses which store key words fulfilling the relation of being larger than the search key. Symbols LO 24-1 and RO 25-1 denote output ports for calculated results at the first level of the MBSE 20, and thenceforth, symbols LO 26-L and RO 27-L denote output ports for calculated results at the L-th level of the MBSE 20. Regarding each BSE 21, symbol DT 23 denotes a port for inputing the corresponding m bits of the bit sliced search key, symbol LB 38 a port for outputing the least one of memory bank addresses which store key words fulfilling the relation of being equal to or larger than the search key, and symbol RB 39 a port for outputing the least one of memory bank addresses which store key words fulfilling the relation of being larger than the search key. Symbols LI 28-1 and RI 29-1 denote input ports for the control information signals of the first level which are input from the slice of the immediate upper digit, and thenceforth, symbols LI 30-L and RI 31-L denote input ports for the control information signals of the L-th level which are input from the slice of the immediate upper digit. Symbols LO 32-1 and RO 33-1 denote output ports for calculated results at the first level, and thenceforth, symbols LO 34-L and RO 35-L denote output ports for calculated results at the L-th level. As shown in Fig. 3, the search key is divided into m-bit slices numbering (k + 1). It is assumed that data a 1,0 be input to the MBSE 20 at a time 0. It is at a time k that data a l,k is input to the BSE 21-k. That is, the calculation of the BSE 21-k proceeds with a delay of one time interval relative to that of the BSE 21-k - 1. This is based on the fact that the calculation of the data a l,k in the BSE 21-k requires a calculated result on data a 1,k-1 in the BSE 21-k - 1. The BSE 21-k obtains control information concerning them, from the BSE 21-k - 1. Fig. 4 is a block diagram of the bit sliced searcher. It corresponds to the BSE 21-k in Fig. 3. The bit sliced searcher is constructed of control circuits 30 (hereinbelow, abbreviated to 'CLs 30'), and memory banks 31 (hereinbelow, abbreviated to 'MBs 31') for storing key words. Since the key words are stored as the LSBT structure, one word is stored in the MB 31-1 of the first level, two words are stored in the MB 31-2 of the second level, ..... and 2 L-1 words are stored in the MB 31-L of the L-th level. The searching process of the searching engine of the present invention is started from the root of the LSBT structure. The operated result between the MB 31-1 of the first level and a search key is transmitted, whereupon operations similarly proceed to the lower levels. The range of locations which store the key words agreeing with the search key is found from the operated result between the MB 31-L of the L-th level and the search key. The control circuits 30 of the respective levels within the bit sliced engine shown in Fig. 4 are common. Input information and output information at each level will be explained. Here, the ℓ-th level will be referred to. Numeral 32 designates control information indicative of the moving direction of a left boundary, which has been determined as the result of the operation at the ℓ-th level of the (k - 1)-th slice, while numeral 33 designates control information indicative of the moving direction of a right boundary, which has been similarly determined as the result of the operation at the ℓ-th level of the (k - 1)-th slice. Numeral 310 indicates the search key which is compared with the key word of the ℓ-th level. Control information items 311 and 312 respectively inform the ℓ-th level of the corresponding slice, of the movements of a left boundary determined as the result of the operation at the (ℓ - 1)-th level and a right boundary determined as the result of the operation at the (ℓ - 1)-th level. Control information items 36 and 37 respectively inform the ℓ-th level of the (k + 1)-th slice, of the movements of the left boundary and the right boundary at the particular level of the corresponding slice. Numeral 313 indicates the search key which is transmitted to the (ℓ + 1)-th level of the corresponding slice. Input/output lines 314 and 315 respectively transmit the left boundary and the right boundary determined as the results of the operations at the particular level of the corresponding slice. Fig. 5 is a block diagram of the control circuit 30-ℓ of the ℓ-th level in the bit sliced searcher 21-k shown in Fig. 4. Symbol Wl 40 denotes a latch which is supplied with the left boundary determined as the result of the operation of the (ℓ - 1)-th level, while symbol WR 41 denotes a latch which is supplied with the right boundary determined as the result of the operation of the (ℓ - 1)-th level. Shown at symbol CL 42 is a control circuit which receives the search key as well as the key word in the memory bank pointed by the left boundary and the right boundary determined at the (ℓ - 1)-th level and the control information items expressive of the movements of the left boundary and the right boundary as supplied from the ℓ-th level in the BSE 21-k + 1, and which delivers the movements of the left boundary and the right boundary at the particular level of the corresponding slice to the ℓ-th level in the BSE 21-k + 1. Symbol K 43 denotes a latch for the search key which is received from the (ℓ - 1)-th level. A register LB 44 receives the movement of the left boundary being the operated result at the particular level of the corresponding slice and the left boundary determined at the (ℓ - 1)-th level and delivers the left boundary determined at the ℓ-th level, while a register RB 45 receives the movement of the right boundary being the operated result at the particular level of the corresponding slice and the right boundary determined at the (ℓ - 1)-th level and delivers the right boundary determined at the ℓ-th level. A latch LO 46 receives the movement of the left boundary being the operated result at the particular level and delivers the movement of the left boundary to the ℓ-th level of the BSE 21-k + 1, while a latch RO 47 receives the movement of the right boundary being the operated result at the particular level and delivers the movement of the right boundary to the ℓ-th level of the BSE 21-k + 1. The CL 42 is such that the state transition diagram of Fig. 2 has been realized by the circuit arrangement. Between the ℓ-th level in the BSE 21-k and the tables in Figs. 2(a) and 2(b), the information 32 corresponds to CI L , the information 33 to CI R , the information 36 to CO L , and the information 37 to CO R . The respective registers LB 44 and RB 45 determine the left boundary and the right boundary at the ℓ-th level by adding bits expressive of the movements of the left boundary and the right boundary determined at the particular level, to the least significant bits of the left boundary and the right boundary received from the (ℓ - 1)-th level, and transmit the determined left and right boundaries to the (ℓ + 1)-th level. Fig. 6 is for explaining a case where variable-length data are handled with the bit sliced searchers. Symbol CL 50 denotes a control circuit which performs the separation control of the bit sliced searchers, and symbol CS 51 a control signal which is input to the control circuit CL 50. The CS 51-0 is normally ON, and is input to the MBSE 20. Each BSE 21 is furnished with the CL 50 as shown in Fig. 6, and the CS 51 is turned ON or OFF. This makes it possible to supply respective inputs LI 28 and RI 29 with the output signals LO 32 and RO 33 of the immediate upper-digit slice as they are (for CS 51 = OFF) or to supply the input LI 28 with '0' and RI 29 with '1' at all times (for CS 51 = ON). The control signal is applied to the respective levels of the identical slice in common. The BSEs 21-k whose CSs 51-k have been turned ON operate equivalently to the MBSE 20 which processes the most significant m bits of a search key. Accordingly, one searching engine which executes the searching process of long data or a plurality of searching engines each of which executes the searching process of short data can be built by setting desired ones of the CSs 51 to be ON and OFF. According to the present invention, a searching engine conforming to a variation in data length can be flexibly built. Here, the searching engine is an apparatus in which a plurality of bit sliced searchers are connected. Control information which is inputted from and outputted to each bit sliced searcher is composed of 2 bits, and LOG 2 N comparators are required in a seraching process which handles N key words. Therefore, the number of pins which are required in a LSI implementation of the bit sliced searchers becomes 4·LOG 2 N with the input/ output control information taken into account. This value becomes 48 when N = 4096 is assumed. In case of subjecting a search key to 1-bit slicing, the number of pins suffices with 50 odd even when pins for input data, a power source, ground etc. are added. Besides, the number of required transistors is predicted to be on the order of 100 thousands in an SRAM (Static Random Access Memory) and on the order of 50 thousands in a DRAM (Dynamic Random Access Memory), and they can be satisfactorily realized with the present-day LSI technology.

Claims: A method of searching n-digit key words K, the digits having the same order being stored at addresses of a store as a corresponding predetermined binary tree at respective levels of said binary tree and in a predetermined order, said method using an n-digit search key S and including, starting from the first level and ending at the last level, for each digit of the search key S, a comparison process for obtaining the least one of the memory addresses which stores the key word digit fulfilling the relation of being larger than or equal to the corresponding search key digit, the found address being called the left boundary of a search range, and a comparison process for obtaining the least one of the memory addresses which stores the key word digit fulfilling the relation of being larger than the corresponding search key digit, the found address being called the right boundary of said search range, the calculated result on a level for a digit being used for the processing of the comparison on the same level for the next lower-order digit, each key word digit being divided in digits of m bits the method using a system having bit sliced searchers, each bit sliced searcher receiving the corresponding digit of the n-digit search key and the corresponding digits of the key words on each level to determine the trace direction to the following level, and outputting said search range of memory addresses, said searching starting from the searcher dealing with the most significant digit that caries forward control information to the next searcher dealing with the next lower digit, said control information relating to the movements of the left boundary and the right boundary of the corresponding searcher, so as to inform the next searcher only to search the key word digits within the search range of the searcher of the immediate upper digit, whereby the timing of the data to be applied to a searcher is delayed by one time period with respect to a timing of the data to be applied to the searcher for an immediate upper searcher, said method comprising the following steps: (a) comparing at the first level during the first time period in the first searcher dealing with the most significant digit the most significant digit of the first search key and outputting the search range of addresses for the most significant digit of the first search key, and outputting control information to the second searcher at the first level which is the moving direction of the left boundary and that of the right boundary of the first searcher; (b) comparing during the second time period in the first searcher at the first level dealing with the most significant digit the most significant digit of the second search key and outputting the search range of addresses for the most significant digit of the second search key, and outputting control information to the second searcher at the first level which is the moving direction of the left boundary of the first searcher and that of the right boundary of the first searcher; comparing during the second time period in the first searcher at the second level dealing with the most significant digit the most significant digit of the first search key and outputting the search range of addresses for the most significant digit of the first search key, and outputting control information to the second searcher at the second level which is the moving direction of the left boundary and that of the right boundary of the first searcher; and comparing during the second time period in the second searcher at the first level the next lower digit of the first search key and outputting the range of addresses for the next-lower digit of the first search key, and outputting control information to the third searcher at the first level which is the moving direction of the left boundary and that of the right boundary of the second searcher; (c) before performing calculations in the second searcher two transition state tables of the first searcher are obtained each of which receives for the searcher four information items that consist of two control information items expressing operations in a search range as applied from the searcher of an immediate upper digit, information on a compared result between the key word digit of the particular searcher and search key digit, and information on a state of a searching process, this means informing the searcher of an immediate lower digit of a search range and determining a state of a searching process of said particular searcher; (d) repeating steps (b) and (c) in following time periods for the following searchers. A method of searching as defined in claim 1, wherein according to slicing, control information flows from a slice of an immediate upper digit, which stores upper-digit m bits of the key word of a particular slice, to a slice of an immediate lower digit, so as to inform the particular slice of a search range searched in the slice of the immediate upper digit and to search in said particular slice only the key words within the search range of the slice of the immediate upper digit. A method of searching as defined in claim 2, wherein the control information is used for performing a control which realizes one searching engine for processing long data or a plurality of searching engines for processing short data respectively. An apparatus for searching n-digit key words K, the digits having the same order being stored at memory addresses of a store as a corresponding predetermined binary tree at respective levels of said binary tree and in a predetermined order, said apparatus using an n-digit search key S and including, starting from the first level and ending at the last level, for each digit of the search key S, a comparison process for obtaining the least one of the memory addresses which stores the key word digit fulfilling the relation of being larger than or equal to the corresponding search key digit, the found address being called the left boundary of a search range, and a comparison process for obtaining the least one of the memory addresses which stores the key word digit fulfilling the relation of being larger than the corresponding search key digit, the found address being called the right boundary of said search range, the calculated result on a level for a digit being used for the processing of the comparison on the same level for the next lower-order digit, means for dividing each key word digit in digits of m bits, and a plurality of bit sliced searchers (20, 21), each bit sliced searcher receiving the corresponding digit of the n-digit search key and the corresponding digits of the key words on each level to determine the trace direction to the following level, and outputting said search range of memory addresses, wherein said searchers start from the one dealing with the most significant digit and carry forward control information to the searcher dealing with the next lower digit, said control information relating to the movements of the left boundary and the right boundary of the corresponding searcher, so as to inform the next searcher only to search the key word digits within the search range of the searcher of the immediate upper digit, whereby the timing of the data to be applied to a searcher is delayed by one time period with respect to a timing of the data to be applied to the searcher for an immediate upper searcher, said apparatus comprising further: (a) means for comparing at the first level during the first time period in the first searcher dealing with the most significant digit the most significant digit of the first search key and for outputting the search range of addresses for the most significant digit of the first search key, and for outputting control information to the second searcher at the first level which is the moving direction of the left boundary and that of the right boundary of the first searcher; (b) means for comparing during the second time period in the first searcher at the first level dealing with the most significant digit the most significant digit of the second search key and for outputting the range of addresses for the most significant digit of the second search key, and for out-putting control information to the second searcher at the first level which is the moving direction of the left boundary of the first searcher and that of the right boundary of the first searcher; means for comparing during the second time period in the first searcher at the second level dealing with the most significant digit the most significant digit of the first search key and for outputting the search range of addresses for the most significant digit of the first search key, and for outputting control information to the second searcher at the second level which is the moving direction of the left boundary and that of the right boundary of the first searcher; and means for comparing during the second time period in the second searcher at the first level the next lower digit of the first search key and for outputting the range of addresses for the next-lower digit of the first search key, and for outputting control information to the third searcher at the first level which is the moving direction of the left boundary and that of the right boundary of the second searcher; wherein, (c) before performing calculations in the second searcher two transition state tables of the first searcher are obtained each of which receives for the searcher four information items that consist of two control information items expressing operations in a search range as applied from the searcher of an immediate upper digit, information on a compared result between the key word of the particular searcher and search key, and information on a state of a searching process, this means informing the searcher of an immediate lower digit of a search range and determining a state of a searching process of said particular searcher; and wherein (d) steps (b) and (c) are repeated in following time periods for the following searchers. An apparatus for searching as defined in claim 4, wherein the control information is used for performing a control which realizes one searching engine for processing long data or a plurality of searching engines for processing short data respectively.

Inventors: TANAKA YUZURU, TSUCHIDA MASASHI, YAMAMOTO AKIRA, TANAKA, YUZURU, TSUCHIDA, MASASHI, YAMAMOTO, AKIRA
Applicants: HITACHI LTD, TANAKA YUZURU, HITACHI, LTD., TANAKA, YUZURU
Application year: 1985
Main classification: G06F17
IPC codes: G06F17, G06F7