哈希表与一般查找方法的比较及冲突的解决

Comparison between Hash Table and Common Searching Method,and Solution to Collision of Hash Function

众所周知,在表中查找记录时需进行查找值和关键字的比较。这一类查找方法建立在"比较"的基础上。一般的查找方法有:顺序查找、折半查找、二叉查找。查找的效率依赖于查找过程中所进行的比较次数,甚至有一些数据的位置会影响某一次查找效率。理想的是希望不经任何比较,一次存取便能得到所需查找的记录。这个理想的情况可以通过哈希表来实现。

It is known that when searching the table for data, comparison is made with the keyword which exit in the table. In another word, comparison is the base of common searching method in finding out the data. Such methods are.. Sequential Search, Binary Search and Binary Sort Tree Search. But the efficiency of these methods depends on the times of comparisons made. Even more, sometimes data in the bad sector takes a long time to finish the comparison. The ideal method is the one that needs no comparison in the process of searching; and this ideal goal can be achieved by application of the Hash Table.