Weighted increment linear search for scatter tables

By Fabrizio Luccio

Communications of the ACM, Vol. 15 No. 12, Pages 1045-1047
10.1145/361598.361617

A new linear search for hash tables whose increment step is a function of the key being addressed is presented. Comparisons with known methods are given, in terms of efficiency and computation complexity. In particular, the new method applies to tables of size n = 2r. It allows full table searching, and practically eliminates primary clustering at a very low cost.

The full text of this article is premium content

0 Comments

No entries found

Purchase the Article

Weighted increment linear search for scatter tables

The full text of this article is premium content

0 Comments

Forgot your password?

Need Access?

Join the ACM

Subscribe to Communications of the ACM Magazine