Perfect hashing functions

Author:

Sprugnoli Renzo1

Affiliation:

1. Istituto di Elaborazione della Informazione del Consiglo Nazionale delle Ricerche, Pisa, Italy

Abstract

A refinement of hashing which allows retrieval of an item in a static table with a single probe is considered. Given a set I of identifiers, two methods are presented for building, in a mechanical way, perfect hashing functions, i.e. functions transforming the elements of I into unique addresses. The first method, the “quotient reduction” method, is shown to be complete in the sense that for every set I the smallest table in which the elements of I can be stored and from which they can be retrieved by using a perfect hashing function constructed by this method can be found. However, for nonuniformly distributed sets, this method can give rather sparse tables. The second method, the “remainder reduction” method, is not complete in the above sense, but it seems to give minimal (or almost minimal) tables for every kind of set. The two techniques are applicable directly to small sets. Some methods to extend these results to larger sets are also presented. A rough comparison with ordinary hashing is given which shows that this method can be used conveniently in several practical applications.

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science

Reference7 articles.

1. The external language KLIPA for the URAL-2 digital computer

2. Hashing functions

3. An empirical study of FORTRAN programs

4. Knuth D.E. The Art of Computer Programming Vol. 1-3. Addison-Wesley Reading Mass. 1968-1973. Knuth D.E. The Art of Computer Programming Vol. 1-3. Addison-Wesley Reading Mass. 1968-1973.

5. Hash Table Methods

Cited by 99 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. An efficient image tamper detection and self-recovery scheme using rehashing model based digital watermarking;Thirteenth International Conference on Digital Image Processing (ICDIP 2021);2021-06-30

2. BBoxDB: a distributed and highly available key-bounding-box-value store;Distributed and Parallel Databases;2019-11-15

3. Investigating the Use of Primes in Hashing for Volumetric Data;Proceedings of the 4th International Conference on Geographical Information Systems Theory, Applications and Management;2018

4. Image Content Authentication and Self-recovery Using Rehashing and Matrix Combined Method;Communications in Computer and Information Science;2016

5. A Perfect Hash Model Used for Image Content Tamper Detection;Communications in Computer and Information Science;2016

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3