Istituto di Scienza e Tecnologie dell'Informazione     
Luccio F. Weighted increment linear search for scatter tables. In: Communication of the ACM, vol. 15 (12) pp. 1045 - 1047. ACM New York, NY, USA, 1972.
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.
URL: http://cacm.acm.org/magazines/1972/12
DOI: 10.1145/361598.361617

Icona documento 1) Download Document PDF

Icona documento Open access Icona documento Restricted Icona documento Private


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional