Affiliation:
1. Digital Equipment Corp., Maynard
Abstract
A new method of hash coding is presented and is shown to possess desirable attributes. Specifically, the algorithm is simple, efficient, and exhaustive, while needing little time per probe and using few probes per lookup. Performance data and implementation hints are also given.
Publisher
Association for Computing Machinery (ACM)
Cited by
38 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Hashing Functions: Examples and Evaluation;Hashing in Computer Science;2010-07-29
2. Double Hashing;Hashing in Computer Science;2010-07-29
3. Shift Hashing for Memory-Constrained Applications;2009 33rd Annual IEEE International Computer Software and Applications Conference;2009
4. PACKET INDEXING PROCESS OPTIMIZED FOR HIGH-SPEED NETWORK PROCESSORS;Journal of Circuits, Systems and Computers;2005-08
5. Technical correspondence;Communications of the ACM;1991-11