A scheme for constructing ordered minimal perfect hashing functions (Q1820600)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3997198
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A scheme for constructing ordered minimal perfect hashing functions |
scientific article; zbMATH DE number 3997198 |
Statements
A scheme for constructing ordered minimal perfect hashing functions (English)
0 references
1986
0 references
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.
0 references
minimal perfect hashing functions
0 references
0.8250486254692078
0 references
0.8086050748825073
0 references
0.7984428405761719
0 references
