A scheme for constructing ordered minimal perfect hashing functions

DOI10.1016/0020-0255(86)90033-2MaRDI QIDQ1820600zbMATH OpenOpenAlexFDO

Authors Chin-Chen Chang

Publication date 1986

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0255(86)90033-2

zbMATH Keywords

minimal perfect hashing functions

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20)

Review text

This paper describes a method to be used for the organization and retrieval of data. Jaeschke proposed the function \(h(k)=\lfloor C/(Dk+E)\rfloor mod n\), where n is the size of a given key set, for constructing minimal perfect hashing functions. We propose another minimal perfect hashing scheme based upon number theory, with the function \(h(k)=\lfloor C/T(k)\rfloor mod n\). The keys can be stored in ascending order by applying this hashing function. A straightforward method to calculate the important parameter C is presented.

Recommendations

• An ordered minimal perfect hashing scheme based upon Euler's theorem
• scientific article; zbMATH DE number 88958
• Minimal perfect hashing in polynomial time
• scientific article; zbMATH DE number 31674
• Experimental and Efficient Algorithms

Cites work

• Addressing for Random-Access Storage with Multiple Bucket Capacities
• An indirect chaining method for addressing on secondary keys
• An ordered minimal perfect hashing scheme based upon Euler's theorem
• Analysis of a file addressing method
• Axioms and hulls
• scientific article; zbMATH DE number 3646329 (Why is no real title available?)
• scientific article; zbMATH DE number 3466515 (Why is no real title available?)
• Perfect hashing functions
• Reciprocal hashing
• The Study of a New Perfect Hash Scheme

Cited in

(6)

• An ordered minimal perfect hashing scheme based upon Euler's theorem
• Phorma: perfectly hashable order restricted multidimensional arrays
• A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata
• scientific article; zbMATH DE number 1984223 (Why is no real title available?)
• scientific article; zbMATH DE number 7051248 (Why is no real title available?)
• scientific article; zbMATH DE number 898084 (Why is no real title available?)

This page was built for publication: A scheme for constructing ordered minimal perfect hashing functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1820600)