Thumbnail
Access Restriction
Subscribed

Author Jaeschke, G.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Minimal perfect hashing ♦ Hashing methods ♦ Searching ♦ Quotient reduction
Abstract A method is presented for building minimal perfect hash functions, i.e., functions which allow single probe retrieval from minimally sized tables of identifier sets. A proof of existence for minimal perfect hash functions of a special type (reciprocal type) is given. Two algorithms for determining hash functions of reciprocal type are presented and their practical limitations are discussed. Further, some application results are given and compared with those of earlier approaches for perfect hashing.
Description Affiliation: Heidelberg Scientific Center, Niederlassung Heidelberg, Germany (Jaeschke, G.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 24
Issue Number 12
Page Count 5
Starting Page 829
Ending Page 833


Open content in new tab

   Open content in new tab
Source: ACM Digital Library