| 摘要 |
<p>The present invention relates to the data structure of a high-speed retrievable table, especially to an information apparatus with a table that can realize the longest prefix match search at high speed and that can also perform operations at high speed such as the retrieval and preparation of a table, or the addition, modification, and deletion of table items. A retrieval key to be used for the retrieval of a table is divided into a plurality of divided retrieval keys consisting of a plurality of bit strings. Each divided retrieval key corresponds to a retrieval table. The first retrieval table is retrieved by the divided retrieval key (A bits). If the final result is obtained, the result is output unchanged. If a pointer to a second retrieval table is obtained, the second retrieval table is retrieved by the second divided retrieval key (B bits). In this way, a retrieval process continues using the divided retrieval keys. <IMAGE></p> |
