| 摘要 |
PROBLEM TO BE SOLVED: To provide a hash table retrieval method and device with high memory use efficiency by speeding up the processing by reducing the calculating amounts of a hash function, and by making it unnecessary to facilitate any synonym countermeasure by preventing the generation of synonym. SOLUTION: A key obtaining part 104 obtains a key from a hash chart storage part 108 according to the hash value of a hash calculating part 103, and compares it with a retrieval key by a key coincidence judging part 105 for judging whether or not this key is a key to be retrieved. When they are not coincident with each other, it is judged that this key is not registered in a table. When they are coincident with each other, any synonym is not generated so that this key can be turned into an objective key, and data are obtained by a data obtaining part 106, and stored in a data storing part 107. It is possible to speed up the retrieval by reducing the arithmetic amounts of the hash calculating part 103, and making it unnecessary to facilitate any synonym countermeasure. Also, it is possible to reduce the capacity of the table by storing the data themselves by using the space area of the hash chart storing part 108.
|
