Evaluation and selection of hash techniques in a paged environment

The performance of techniques for hash tables management in pages environments is examined. Classical methods as open addressing are considered; a new technique, called CHAT, is presented:it is performed on doubly linked chained hash tables. A comparison and an evaluation of the efficiency of the above methods are made in regard to the average search length, the average memory access and, more important, the average page faults. Experimental result show that the proposed method, open addressing with linear probing and chaining with double pointers are efficient in paged environments; moreover CHAT appears to be more favourable than others when the keys are not distributed.