A polynomial time generator for minimal perfect hash functions
Communications of the ACM
Data base organization for data management (2nd ed.)
Data base organization for data management (2nd ed.)
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The study of an ordered minimal perfect hashing scheme
Communications of the ACM
Reciprocal hashing: a method for generating minimal perfect hashing functions
Communications of the ACM
Minimal perfect hash functions made simple
Communications of the ACM
Perfect hashing functions: a single probe retrieving method for static sets
Communications of the ACM
A letter oriented minimal perfect hashing function
ACM SIGPLAN Notices
The Study of a New Perfect Hash Scheme
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
Collected specimens can highlight visitor's understanding of nature and evolutionary history from museum. Thus, museum's physical collection is often used to produce exhibits. However, it is a trend to create physical exhibit and web exhibit concurrently. The purpose is to serve different audiences using different delivery systems. Museum's collections that stored and managed into a large database, termed content databases provide valuable information and data for use in the development of e-learning. The database for specific exhibit can be used as educational resources to providing a full interactive learning experience for students and casual information seekers. However, collision free, no waste of memory space and fast searching are three important factors as searching related specimen from the web. This paper is to propose a new scheme for constructing letter-oriented minimal perfect hashing functions to benefit searching experience, which is based on the Newton's interpolating polynomials.