Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Weighted increment linear search for scatter tables

Weighted increment linear search for scatter tables 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 = 2 r . It allows full table searching, and practically eliminates primary clustering at a very low cost. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Communications of the ACM Association for Computing Machinery

Weighted increment linear search for scatter tables

Luccio, Fabrizio
Communications of the ACM , Volume 15 (12) – Dec 1, 1972
Download PDF
3 pages

Loading next page...
 
/lp/association-for-computing-machinery/weighted-increment-linear-search-for-scatter-tables-MjmH0KX1U0

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 1972 by ACM Inc.
ISSN
0001-0782
DOI
10.1145/361598.361617
Publisher site
See Article on Publisher Site

Abstract

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 = 2 r . It allows full table searching, and practically eliminates primary clustering at a very low cost.

Journal

Communications of the ACM – Association for Computing Machinery

Published: Dec 1, 1972

There are no references for this article.