一种哈希表快速查找的改进方法

哈希表由于其速度快的优点在数据查询中有着广泛的应用。本文在结合冲突解决机制和数据元素被查找的先验概率的基础上，提出了一种提高哈希表查找效率的优化方法，并对该方法在链地址法处理哈希冲突的情况下进行了理论分析，与原哈希表方法相比，该方法降低了冲突时执行查询的查找长度，从而使查询响应时间更短。最后对该方法进行行了实例验证，实验结果表明，新方法是有效并且简便的。

An Improved Fast Searching Method of Hash Table

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 in chaining 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.