| 摘要 |
<p>PROBLEM TO BE SOLVED: To provide a data structure of a table which can attain high-speed retrieval without wastage of entries, using a small memory capacity. SOLUTION: A retrieval key used to retrieve a table is divided into split retrieval keys consisting of bit streams. Each split retrieval key is provided with a corresponding retrieval table, and the size of the table retrieved by one split retrieval key is selected smaller than the size of the table for a single retrieval by the entire retrieval keys. First, the split retrieval key (A-bits) retrieves a primary retrieval table and when a result is obtained, the result is outputted as is. When a pointer to a secondary retrieval table is obtained, the secondary retrieval table is retrieved by using the split retrieval key (B-bits). Likewise, the split retrieval keys are used for the retrieval.</p> |
