Abstract
This paper proposes a new ordered minimal perfect hashing scheme with only one parameter. By applying our hashing functions, all keys can be stored in ascending order. There is one very straightforward formula to compute the only parameter C, that requires O( n log 2 k n ) time, where n is the total number of keys and k n is the key with maximum magnitude.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
