改进的哈希表查找算法  

Improved Searching Method of Hash Table

作　　者：朱芳芳[1] 李训根[1] 

机构地区：[1]杭州电子科技大学电子信息学院,浙江杭州310018

出　　处：《杭州电子科技大学学报（自然科学版）》2013年第5期46-49,共4页Journal of Hangzhou Dianzi University：Natural Sciences

摘　　要：哈希表查找作为一种快速的数据查询算法被广泛应用。为了更好地查找和解决哈希冲突,在构建哈希表时常选用链地址法来解决冲突。由于在查找哈希表时需要遍历链表,大大降低了查找效率。该文在结合链地址法和二分查找的基础上,提出了一种提高哈希表查找效率的改进方法。实验结果表明,该方法降低了冲突时执行查询的查找长度,从而降低了查询所需的时间。Hash table has been widely used as a fast searching method in data query. In order to search and resolve hash collision, the method of chain addressing has been usually adopted to resolve hash collision when creating a hash table. This method needs traversing the list in the process of searching hash table, which greatly reduces the searching efficiency. This paper proposed an improved method which improves hashing based on chain addressing and binary search.

关 键 词：链地址法 哈希表 哈希查找 哈希冲突 二分查找 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]