| 摘要 |
<p><P>PROBLEM TO BE SOLVED: To materialize a retrieval function of accessing information about a description at high speed while effectively using a memory. <P>SOLUTION: Spot index information 41 includes an array represented by "Y=Array[X]". The array can acquire Y by designating a suffix X to Array. Future index information 61 includes map. As an internal mechanism of map, generally, a hash function (Hash function) is implemented. The hash function is represented by "Y=HashFunc(X)". That is, a nine-digit description code X is coded by a certain rule, and an internal index value Y is generated. <P>COPYRIGHT: (C)2009,JPO&INPIT</p> |
