No abstract

This paper presented a improved method of hash table, the algorithm based on transform and conquer, established a number of small-scale array, then imitated binary search processes and reduced the hash collision. Simulation results shows that , not only the continuous memory requirement is reduced greatly, but also that when the hash collisions occur, the searching efficiency is improved by an order of magnitude from O(n) to O(logn), the space utilization rate is also improved greatly.