JP3292241B2 - Table creation search device - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

[0001] The present invention relates to, for example, a MAC.
(Media Access Control) A table creation device that stores data such as an address and creates a table such as a MAC address table, and specifies a table having the same data array as a table created using the table creation device as described above. Data (for example,
The present invention relates to a table search device for searching for a specific MAC address.

[0002]

2. Description of the Related Art For example, a LAN (Local Area)
Network), the MAC of each host to be connected
A conventional network management apparatus that manages the LAN by executing the totalization of the number of times of transmission and reception of each host based on the address has a MAC address table as shown in FIG. The MAC address table is composed of a number of rows, and each row stores a MAC address (shown as a, b, c,... In the figure) of a host connected to the LAN. Address area MA,
For example, a management data area DA (for example, management data area DA) in which total data of the number of transmissions and receptions of the host is stored.
Is more precisely divided into a large number of small areas, each of which stores the corresponding aggregation data and the like one by one). Each time a host is additionally connected to the LAN, the host is given a vacant row in the MAC address table,
The MAC address of the host is stored in the address area MA, and thereafter, the total data and the like relating to the host are stored in the management data area DA of the row.

In order to update and store the above-mentioned total data and the like of a specific host in the management data area DA of the MAC address table as described above, it is necessary to obtain a row in which the MAC address of the host is stored (ie, In order to obtain a row in which the MAC address of the host is stored in the MAC address area MA), the MAC address stored in the table sequentially from the first row to the last row, one row at a time. Is compared with the MAC address of the host to determine whether they match.
Continue until the addresses match.

[0004]

However, a table is created by storing data (in the above example, a MAC address) by the above-described method, and a specific table is created from the table by the above-described method. To search for data, the data stored at the beginning of the table (M in FIG. 7)
In the AC address table, data a,
In the case of searching for b or c), the search time is short, but when searching for data stored at the end of the table (such as the data r shown in FIG. 7 in FIG. 7). Increases the search time. Then, as the number of data stored in the table increases (in the above example, the number of hosts connected to the LAN increases and the number of MAC addresses increases), the search time generally increases.

SUMMARY OF THE INVENTION The present invention has been made in view of the above-described circumstances, and even if the number of stored data increases, a table creating apparatus for creating a data array table that does not increase the search time for the data. It is another object of the present invention to provide a table search device for searching data from the table in a short time.

[0006]

According to the first aspect of the present invention, m-bit data sequentially transmitted (however, data in which all of m bits are 0 are excluded) is stored in a table, which will be described later. The table creating apparatus for storing the data in the table in the means is configured as follows. That is, it is composed of 2 n (where n <m) power rows each having a row number specifying the row, and each row is at least a data storage area for storing the m-bit data. And a main table having an index area in which an index described later is stored, and a large number of rows (about the number of m-bit data actually used) each provided with a row number specifying the row. Each row is a table storage means having a sub-table having at least a data storage area for storing the m-bit data and an index area for storing an index described later. Each time it arrives, the higher-order a (where a is a predetermined number of 0 or more) bits are removed from the transmitted m-bit data,
Further, n obtained by excluding lower-order b (where b is a predetermined number of 0 or more) bits (thus n = ma-
b) The bit data is read, the line number corresponding to the n-bit data is obtained, and then the data is already sent to the data storage area of the line in the main table to which the line number is given. First determining means for determining whether or not the stored m-bit data is stored; and, when the first determining means makes a negative determination, a row in the main table which has been determined by the first determining means. In the first data storage area, the m-bit data transmitted this time is stored.
A storage means, and a second determination means for determining whether or not the already stored m-bit data is equal to the m-bit data transmitted this time when the first determination means makes a positive determination. When the second determination means makes a negative determination, it is determined whether or not an index has already been stored in the index area of the row in the main table which has been determined by the first determination means. When the third judging means and the third judging means make a negative judgment, a row in the sub-table in which the m-bit data is not yet stored is found, and the row is stored in the data storage area of the row. The second storage means for storing the m-bit data transmitted this time, and when the second storage means has completed the storage processing, the row number of the row to which the data storage area in which the storage processing has been performed belongs is entered. The third storage means for storing as an index in the index area of the row in the main table which has been determined by the third determination means, and the third determination means has been determined when the third determination means has made a positive determination. Based on the row number stored as an index in the index area of the row in the main table, a row in the sub-table to which the row number is given is searched, and the row is already stored in the data storage area of the row. The fourth determination means for determining whether or not the m-bit data is the same data as the m-bit data transmitted this time, and when the fourth determination means makes a negative determination, or when the sixth determination means described later When a negative judgment is made, the fourth judgment means or the sixth judgment
Fifth determining means for determining whether or not an index is stored in the index area of the row in the sub-table which has been determined by the determining means; and determining when the fifth determining means makes a positive determination. Based on the row number of the sub-table stored as an index in the target index area, a row in the sub-table to which the row number is given is searched, and m stored in the data storage area of the row is searched. The bit data is determined by a sixth determining means for determining whether or not the data is the same as the m-bit data transmitted this time. In the data storage area of which no m-bit data is stored yet, and storing the m-bit data transmitted this time in the data storage area of the row. And when the fourth storage means has completed the storage processing, the fifth determination means uses the row number of the row in the sub-table in which the storage was performed by the fourth storage means as an index, and And a fifth storage unit for storing in the index area to be determined.

[0007] In the second aspect of the present invention, each means below the table creating apparatus according to the first aspect is added. That is, the first
First processing means for executing a predetermined processing according to the storage when the storage means has completed the storage processing, and m-bit data already stored when the second determination means makes a positive determination. Second processing means for executing a predetermined process in response to the same data being sent once more, and processing by the second storage means when the third storage means has completed the storage processing. A third processing means for executing a predetermined process in response to the third data, and when the same data as the already stored m-bit data has been sent again when the fourth determining means makes a positive determination. The fourth processing means for executing the predetermined processing, and when the same data as the already stored m-bit data has been sent again when the sixth determination means makes a positive determination. Predetermined processing A fifth processing means for line, when the storing process according to the fifth storage means is completed, and a configuration in which the sixth processing means for executing a predetermined process corresponding to the storage is added.

According to a third aspect of the present invention, a table having the same data array as a table created by the table creating apparatus according to the first or second aspect is used to store a specific m bit stored in the table. A table search device for searching data is configured as follows. That is, every time the m-bit data to be searched is designated, the n-bit data related to the m-bit data is read, and the n-bit data of the row in the main table to which the row number corresponding to the n-bit data is given is read. In the data storage area, stored data determining means for determining whether or not m-bit data to be searched is stored, and when the stored data determining means makes a negative determination or when data stored determination means described later is used. When a negative determination is made, the index area of the row to which the data storage area determined in the previous determination belongs,
An index storage determining unit for determining whether or not an index is stored; and an index stored in an index area determined by the index storage determining unit when the index storage determining unit makes a positive determination. A data stored determination means for determining whether m-bit data to be searched is stored in a row in the sub-table given a row number corresponding to
A predetermined process to be performed when m-bit data to be retrieved can be retrieved when the stored data discriminating unit makes a positive determination or when the data stored determination unit makes a positive determination (for example, A predetermined process executing means for executing a process of reading data stored in another area of the same row in association with exponent m-bit data.

[0009]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Hereinafter, the present invention will be specifically described based on embodiments shown in the drawings. In the present embodiment, the present invention is applied to a MAC address table creation unit and a search unit for the MAC address table of a LAN network management device.

FIG. 1 shows the configuration of a network management apparatus 1 including a table creation unit (apparatus) and a table search unit (apparatus) to which the present invention is applied. That is, the network management device 1 includes the CPU 2
And a ROM 3 and a LAN controller 5 in which a main table MT and a sub table ST, which will be described later, are stored, a program for instructing various operations of the network management apparatus 1 and the like are fixedly stored. Are connected. The LAN controller 5 is connected to a LAN cable 6.

In this embodiment, the MAC address table is divided into a main table MT and a sub table ST.
FIG. 2A shows the former configuration, and FIG. 2B shows the latter configuration. As shown in FIG. 2A, the main table MT is composed of 65536 rows to which one of relative row addresses (base row address is set to D) 0 to 65535 is given (note that 65536 rows are used). Is
In the present embodiment, the lower 2 bytes of the MAC address of 48-bit data, that is, data consisting of 16 bits, is used as the n-bit data, and the data consisting of 16 bits can be represented by 2 to the 16th power, that is, 65536 ways. , One row for each of these data), and each row has a MAC address area MA, an index area IA, and a management data area DA. The MAC address area MA is an area for storing a MAC address, and the index area IA is an area for storing an index for associating that row of the main table with one row in the sub-table,
The management data area DA is further divided into a number of small areas. Each of the small areas includes the number of packet transmissions of a specific host (a host whose MAC address is stored in the MAC address area MA of the row), Data such as the number of packet receptions is stored.

The sub-table ST shown in FIG.
Is the LAN to which the network management device is connected.
, The number of hosts that may be connected, ie, 20
Each row is composed of 200 rows in which one row is given to 0 units. Each row is composed of a MAC address area MA, an index area IA, and a management data area DA, like the main table MT. Note that, unlike the index area IA of the main table MT, the index area IA of the sub table ST stores an index associated with another row in the sub table.

Next, the operation of the present embodiment configured as described above will be described. The network management device according to the present embodiment captures the packet every time a packet is sent from any host to the LAN, detects which host sends it to which host, and detects The totals such as the number of times of packet transmission and the number of times of packet reception are stored in the main table MT and the sub table S.
The update is performed by updating the count value of the management data area DA of T. However, the operation of storing data in both tables and the operation of searching for a MAC address from both tables are almost the same when totaling any of the above data. Therefore, in the following description of the operation, the operation of totaling (counting) the number of transmissions of the transmission source host performed each time a packet is transmitted using both tables and reading the totaling result from both tables Will be described with reference to the flowcharts of FIGS. 3 to 6 as an example. In the following, for convenience, a MAC address, which is 48-bit data, is divided into 4 bits while maintaining the bit arrangement, and each of the 4 bits is divided into 16 bits.
It is displayed as a binary-coded hexadecimal number.

(A) First, a packet is sent in a state where no MAC address is stored in the main table MT and the sub table ST (all 0s are stored in each area of each row). M of the source host
The operation when the AC address is 111000ff0002 will be described as an example. In this case, FIG.
In step S1, the relative row address 2 corresponding to the lower 16-bit data of the MAC address, that is, 0002
(That is, the row address (D + 2)) is obtained, and then the process proceeds to step S2. In this step S2, it is determined that the MAC address has not yet been stored in the MAC address area MA of the row of the relative row address 2 in the main table MT, and the process proceeds to step S3.
The MAC address 1110 is stored in the AC address area MA.
00ff0002 is stored. Thereafter, the process proceeds to step S4, where 1 is stored in an area for storing the number of times of transmission (hereinafter, referred to as a number-of-times-of-transmission area) in the small area in the management data area DA of the above row. With this, MAC address 11
This means that the host of 1000ff0002 has transmitted the packet once.

(B) Next, an operation in a case where a packet is transmitted from the same host after the packet is transmitted will be described as an example. in this case,
In the same manner as described above, the relative row address 2 is obtained in step S1 of FIG. 3, and the process proceeds to step S2.
It is determined that the address is stored, and the process proceeds to step S2.
The process proceeds from step S5 to step S5, where the MAC address already stored is the current transmission source host MA.
After confirming that the address is the same as the C address, step S4
Proceed to. In step S4, the transmission count data in the transmission count area of the management data area DA is updated to one larger by one.

(C) Then, after the above operation (B), MA
The operation when the first packet is sent from the host with the C address of 1000011af0001 will be described as an example. In this case, substantially the same operation as in the case of (A) is performed, and the source MAC address 100011af0001 is stored in the MAC address area MA of the row of the relative row address 1 in the main table MT, and the management data area DA of the row is stored. Is stored in the number-of-times-of-transmission area.

(D) After the operation of (C) (but not limited to immediately after), the lower 16 bits of the same MA
It is assumed that the packet of the C address has not been sent), and in the case of (C), the source MAC address and the lower 1
MAC address 100011de00 with the same 6 bits
The operation when the packet is sent from the host No. 01 will be described as an example. In this case, the relative row address 1 is determined in step S1 of FIG. 3, and the MA of the row of the relative row address 1 in the main table MT is determined in step S2.
In the C address area MA, the MAC address (that is, 1000011af000 stored in the operation of the above (C)) is used.
After confirming that 1) is stored, the process proceeds to step S5. In step S5, the already stored MAC
It is detected that the address is different from the MAC address transmitted this time, and the process proceeds to step S7 in FIG. In this step S7, it is confirmed that the index (the relative row address of the sub-table ST) is not yet stored in the index area IA of the row of the relative row address 1, and the process proceeds to step S8, where The MAC address area MA on that line is still
Find a row where no address is stored, and find that row, eg, relative row address 1 (ie row address (E + 1))
The source MAC of this time is stored in the MAC address area MA of the row
The address 100011de0001 is stored (see the row of the row address (E + 1) in FIG. 2B). Next, proceeding to step S9, the relative row address 1 of the row in the sub-table ST where the source MAC address is stored is stored in the index area IA of the row of the relative row address 1 of the main table MT. (Refer to the index area IA of the relative row address 1 in FIG. 2A). In the following step S10, 1 is stored in the transmission count area in the management data area DA of the row of the relative row address 1 in the sub table ST, and the MAC address 10001 is stored.
It records that there is one transmission from the host of 1de0001.

(E) After the above operation (D) is completed, first, the source MAC address is set to 110011ff00.
00 packets are sent, then some packets whose lower 16 bits of the MAC address are not 0000 are sent, and then the source MAC address is 1100ff
It is assumed that a packet of 110000 is transmitted, and then a packet of a source MAC address of 11aabbf10000 is transmitted.
It is assumed that a packet in which the three MAC addresses of 00 are the source MAC addresses has been sent, and the operation at that time will be described.

First, the source MAC address is 110011.
When the packet of ff0000 is sent, the operation is substantially the same as that of the case (A) (steps S1 to S1 in FIG. 3).
S4) is performed. As a result, the corresponding MAC address is stored in the MAC address area MA of the row of the relative row address 0 of the main table MT (see the row of the row address (D + 0) in FIG. 1 is stored in the transmission count area of the management data area DA of the row. Next, the source MAC address is 1100ff
When the packet of 110000 is sent, it is almost the same as the case of the above (D).
1, the relative row address 0 is obtained. In step S2, the MAC address 11001 is already stored in the MAC address area MA of the row of the relative row address 0 in the main table MT.
1ff0000 is stored, it is detected in step S5 that the MAC address is not the same as the current transmission source MAC address, and in step S7 of FIG. It is detected that the index is not stored in the index area IA, and in step S8, the current transmission source MAC address 1100 is stored in an unused row of the sub table ST, for example, the MAC address area MA of the row of the relative row address 2.
ff110000 (see the MAC address area MA of the row with the relative row address 2 in FIG. 2B), and in step S9, the sub-table ST is stored in the index area IA of the row with the relative row address 0 of the main table MT. The relative row address 2 is stored (see the index area IA of the row with the relative row address 0 in FIG. 2A), and in step S10, the transmission number area of the management data area DA of the row with the relative row address 2 in the sub table ST Is stored in the memory.

Next, when 11aabbbf10000 is sent, the operation is as follows. That is, the relative row address 0 is obtained in step S1 of FIG. 3, and the MA of the row of the relative row address 0 in the main table MT is determined in step S2.
It is detected that the MAC address has already been stored in the C address area MA, and in the next step S5, it is detected that the MAC address stored in the MAC address area MA in the above row is not the 11aabbf0000. In the next step S7 in FIG.
It is detected that the index 2 is stored in the index area IA of the row with the relative row address 0, and in the next step S11, the sub table ST in the sub table ST to which the relative row address 2 corresponding to the index 2 is given. The MAC address stored in the MAC address area MA of the row is the source MAC address 11aabb100 of this time.
00 is not the same as that in step S in FIG.
Proceed to 13. In step S13, it is determined that the index is not stored in the index area IA of the row of the sub-table ST to which the relative row address 2 is given, and the process proceeds to step S15, where the MAC address is not yet stored in the MAC address area MA. The MAC address of this time is stored in a row in the sub-table ST that is not stored, for example, the row of the relative row address 3 (see the row of the relative row address 3 in FIG. 2B). Thereafter, in step S16, the relative row address 2 in the sub-table ST is set using the relative row address 3 in the sub-table ST as an index.
Is stored in the index area IA of the row of the row (the index area I of the row at the relative row address 2 in FIG.
A). Finally, in step S17, the management data area D of the row having the relative row address 3 in the sub-table ST is set.
1 is stored in the transmission count area of A.

(F) After the operation of (E) above, if a packet whose source MAC address is 33322670000, that is, the lower 16 bits are 0000 in the same manner as described above, is transmitted, the above is substantially the same as above. After the operation (steps S1, S2, S5, S7, S11), the process proceeds to step S13 in FIG. 5. In this step S, the index 3 is stored in the index area IA of the row of the relative row address 2 of the sub-table ST. The process proceeds to step S14, and the sub table S to which the relative row address 3 corresponding to the index 3 is given
It is detected that the transmission source MAC address of the MAC address area MA of the row in T is not equal to the current transmission source MAC address, and the process returns to step S13. In step S13, it is confirmed that the index has not been stored in the index area IA of the row to which the relative row address 3 is given. In step S15, an unused row in the sub-table ST, for example, the relative row address is used. In step S16, the relative MAC address is stored in the index area IA of the row to which the relative row address 3 is given. In step S17, the relative MAC address is stored. 1 is stored in the transmission count area of the management data area DA of the row with the relative row address 4.

(G) After the operation (F), the same MAC address as the source MAC address in the operation (F) is used.
When the address 33322620000 is sent as the source MAC address, the following operation is performed. Steps S1, S2, S5, S7, S11, S
In steps S13 and S14, substantially the same processing as in the case of the above (F) is performed.
And here, it is detected that the index 4 is stored in the index area IA of the row of the relative row address 3 of the sub-table ST, and the process returns to step S14 again to return to the relative row address corresponding to the above index 4. 4 is detected, it is detected that the MAC address stored in the MAC address area MA of the row assigned to the row is equal to the current transmission source MAC address. The number of transmissions in the number-of-transmissions area of the management data area DA of the row is increased by one to two.

(H) The operation when the MAC address 100011de0001 already stored in the sub-table ST is sent again as the source MAC address is as follows. That is, the relative row address 1 is determined in step S1, and the main table MT is determined in step S2.
Confirm that the MAC address has already been stored in the MAC address area MA of the row having the relative row address 1 of
What is stored in step S5 is the current transmission source MAC
In step S7, it is detected that an index is stored in the index area IA of the row of the relative row address 1 in the main table MT. In step S11, the relative row address 1 corresponding to the index is detected. , The MAC address stored in the MAC address area MA of the row in the sub-table ST is equal to the current transmission source MAC address, and the process proceeds to step S12, where the relative row address 1
The number of transmissions in the number-of-transmissions area of the management data area DA of the row is increased by one.

Hereinafter, operations substantially similar to the above-described operation examples (A) to (H) are repeated, and various data are stored in the main table MT and the sub-table ST for each MAC address (that is, for each host). It will be counted.

Next, an example of the operation of reading the above-mentioned total data for a specific host from both tables after totaling various data for each MAC address as described above will be described.

(1) First, MAC address 10001
The operation in the case of searching for various data for the host given 1af0001 will be described. First, in step S20 of FIG. 6, a relative row address 1 corresponding to the lower 2 bytes (ie, 16 bits) 0001 of the MAC address is obtained, and thereafter, the process proceeds to step S21, where the row of the relative row address 1 in the main table MT is determined. After confirming that the MAC address is stored in the MAC address area MA (see the row of the relative row address 1 in FIG. 2A), the management data area of the row of the relative row address 1 is determined in step S22. Various data will be read from DA.

(2) Next, the MAC address 333226
The operation in the case of searching for various data for the host given 720000 will be described. First, in step S20 of FIG. 6, the relative row address 0 is obtained in the same manner as described above, and in the following step S21, the MA address is stored in the MAC address area MA of the row of the relative row address 0 in the main table MT.
It is determined that the C address is not stored (see the row of the relative row address 0 in FIG. 2A). Then, in step S23, the index is stored in the index area IA of the row of the relative row address 0. Detect that Thereafter, the process proceeds to step S24, where the MAC address area MA of the row of the sub-table ST to which the relative row address 2 corresponding to the index stored in the index area IA is given is the MAC address 3
It is determined that 33226720,000 is not stored (refer to the row of the relative row address 2 in FIG. 2B), and the process returns to step S23. And this step S23
Is the index area IA of the row of the relative row address 2
Is stored in the index area IA, and in the next step S24, the relative row address 3 corresponding to the index stored in the index area IA is checked.
The above MAC address is not stored in the MAC address area MA of the row (3) in FIG.
Is confirmed), and the process returns to step S23. Then, in this step S, it is confirmed that the index is stored in the index area IA of the row of the relative row address 3, and in the subsequent step S24, the MAC address area MA of the row of the relative row address 4 corresponding to the index is stored. The above MAC address 333226720000
Is stored (refer to the row of relative row address 4 in FIG. 2B), and the process proceeds to step S22 to read various data from the management data area DA of the row of relative row address 4. Will be.

If a negative determination is made in step S23, the data on the host to be searched is stored in the main table MT and the sub table ST.
Are not counted in any of the above.

As described above, in the present embodiment, instead of the search method of sequentially checking each row of the table one line at a time, a relative row address or an index of the main table MT is used to check the rows of the table at intervals. The search time can be greatly reduced.

In this embodiment, various types of data are totaled for each MAC address, and the total
Although the search is performed using the C address, the present invention is not limited to this. The present invention may be applied to a device that aggregates and searches data for each IP address other than the MAC address, for example.
Further, it is needless to say that the present invention can be applied to the case where the MAC address or the IP address is simply registered in the main table MT and the sub table ST without collecting various data.

[0031]

As described above in detail, according to the present invention, even if the number of stored data is increased, a table creating apparatus for creating a table of a data array that does not increase the search time of the data, and the table It is possible to provide a table search device for searching data from a short time.

[Brief description of the drawings]

FIG. 1 is a diagram showing a configuration of a network management device according to an embodiment of the present invention.

FIG. 2 is a diagram showing a configuration of a table created in an embodiment of the present invention.

FIG. 3 to FIG. 5 are flowcharts showing transmission number counting processing of a transmission source host in the above embodiment.

FIG. 6 is a flowchart showing a process of searching for total data in the embodiment.

FIG. 7 is a diagram for explaining a conventional table search process.

[Explanation of symbols]

 Reference Signs List 1 network management device 2 CPU 3 ROM 4 RAM 5 LAN controller 6 LAN cable MA MAC address area DA management data area MT main table ST sub table IA index area

Claims (3)

(57) [Claims] 1. A table for storing sequentially transmitted m-bit data (however, data in which all m bits are 0) is stored in a table in a table storage means described later. The apparatus is composed of 2 n (where n <m) power rows each having a row number specifying the row, and each row stores at least the m-bit data. A main table having a data storage area and an index area for storing an index described later, and a large number of rows (about the number of m-bit data actually used) each having a row number specifying the row. Each row includes at least a data storage area for storing the m-bit data and an index area for storing an index described later. A table storing means having a table, and each time the m-bit data is sent, the higher-order a (where a is a predetermined number of 0 or more) bits from the sent m-bit data , And read out n (thus n = mab) bit data obtained by excluding lower-order b (where b is a predetermined number of 0 or more) bits, and The corresponding row number is obtained, and the data storage area of the row in the main table to which the row number is given is used to determine whether or not the previously transmitted m-bit data is already stored. A first judging means for judging, the first judging means when the first judging means makes a negative judgment;
A first storage unit for storing the m-bit data transmitted this time in a data storage area of a row in the main table which has been determined by the determination unit; Second determining means for determining whether or not the already stored m-bit data is equal to the m-bit data transmitted this time; and when the second determining means makes a negative determination, the first
Third determining means for determining whether or not an index is already stored in the index area of the row in the main table which has been determined by the determining means; and when the third determining means makes a negative determination. A second storage means for finding a row in the sub-table in which the m-bit data is not yet stored, and storing the currently transmitted m-bit data in a data storage area of the row; When the second storage means has completed the storage processing, the row number of the row to which the data storage area in which the storage processing has been performed belongs is indicated by the index of the row in the main table which was determined by the third determination means. Third storage means for storing an index in the area; and when the third determination means makes a positive determination, the index of the row in the main table which is the determination target is determined. Based on the row number stored as an index in the index area, a row in the subtable to which the row number is assigned is searched, and the m-bit data already stored in the data storage area of the row is transmitted this time. A fourth determining means for determining whether or not the data is the same as the m-bit data received; when the fourth determining means makes a negative determination, or when a sixth determining means described later makes a negative determination, 4th each
A fifth determining means for determining whether or not an index is stored in an index area of a row in the sub-table which has been determined by the determining means or the sixth determining means; and the fifth determining means makes a positive determination. Then, based on the row number of the sub-table stored as an index in the index area subject to the determination, a row in the sub-table given the row number is searched, and the data is stored in the data storage area of the row. Sixth determining means for determining whether or not the stored m-bit data is the same data as the m-bit data transmitted this time; and when the fifth determining means makes a negative determination, In the row where no m-bit data is stored yet in the data storage area of the row, and the m-bit data transmitted this time to the data storage area of the row. A fourth storage unit for storing, and when the fourth storage unit has completed the storage processing, the fifth determination is performed by using, as an index, a row number of a row in the sub-table that has been stored by the fourth storage unit. Means for storing immediately before in the index area subject to the determination, a fifth storage means. 2. When the first storage means completes a storage process, a first processing means for executing a predetermined process according to the storage, and when the second determination means makes a positive determination, A second process for executing a predetermined process in response to the same data as the already stored m-bit data being sent once more
Processing means; third processing means for executing predetermined processing according to processing by the second storage means when the third storage means has completed the storage processing; and affirmative determination by the fourth determination means The fourth processing means for executing a predetermined process in response to the same data as the already stored m-bit data being sent again, and the sixth determination means making a positive determination. Then, a predetermined process corresponding to the fact that the same data as the already stored m-bit data has been sent again is executed.
2. The table creating apparatus according to claim 1, further comprising: a processing unit; and a sixth processing unit configured to execute a predetermined process according to the storage when the storage process by the fifth storage unit is completed. . 3. A table for retrieving specific m-bit data stored in a table having the same data array as a table created by the table creating apparatus according to claim 1 or 2. A search device that reads the n-bit data related to the m-bit data each time the m-bit data to be searched is specified;
Storage data determining means for determining whether or not m-bit data to be searched is stored in the data storage area of a row in the main table to which the row number corresponding to the bit data is assigned; When the data discriminating unit makes a negative judgment, or when the data storage judging unit described later makes a negative judgment, the index is set in the index area of the row to which the data storage area that has been judged in the previous judgment belongs. An index storage determining unit for determining whether or not the index is stored; and an index stored in the index area determined by the index storage determining unit when the index storage determining unit makes a positive determination. The row in the subtable given the row number
A data storage completion determining means for determining whether or not m-bit data to be searched is stored; and a search when the stored data determination means makes a positive determination or the data storage completion determination means makes a positive determination. A predetermined process executing means for executing a predetermined process to be performed when m-bit data to be retrieved can be retrieved.