关键词: 哈希表 查询 哈希冲突 先验概率

Abstract:

Hash table has been widely used in data query. This paper puts forward an optimization method which improves hashing, based on a conflict-solving mechanism and the prior probability of the searched elements. Furthermore, this paper analyzes theoretically how this method deals with harsh-conflicts i haining the addresses. Compared with the original hash methods, this algorithm reduces the searching length when conflicts occur so as to shorten the reaction of searching. Finally, the experiments show that this new method is more effective and concise.

Key words: Hash table;query, Hash collision, prior probability