| 摘要 |
PROBLEM TO BE SOLVED: To supply a means for constructing a hash table for retrieval almost without the need of additional processing time and memory consumption when constructing a large-scale transposed index, and to supply a means for constructing a forward index larger than the memory capacity of a calculator. SOLUTION: When writing partial transposed indexes to an auxiliary storage device, they are written in the order of the hash value of an index word. Then, when integrating the partial transposed indexes into the whole transposed index, the hash table is successively prepared. In the meantime, when writing partial forward indexes to the auxiliary storage device, the index word is expressed by a temporary index word identification number supplied in the order of the hash value, a table for converting the temporary index word identification number to a final index word identification number is prepared, and the partial forward indexes are integrated while converting the index word identification number using the table to obtain the final forward index. COPYRIGHT: (C)2009,JPO&INPIT
|
