An efficient hash-based searching for specimens in the museum's exhibit

ABSTRACT

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.

REFERENCES

• 1: C. C. Chang, The study of an ordered minimal perfect hashing scheme, Communications of the ACM, v.27 n.4, p.384-387, April 1984 [doi>10.1145/358027.358051]
• 2: Chang, C. C. and Lee, R. C. T. 1986 A Letter-Oriented Minimal Perfect Hashing Scheme, Computer Journal, Vol. 29, No.3, .277--281.
• 3: Richard J. Cichelli, Minimal perfect hash functions made simple, Communications of the ACM, v.23 n.1, p.17-19, Jan. 1980 [doi>10.1145/358808.358813]
• 4: Curtis R. Cook , R. R. Oldehoeft, A letter oriented minimal perfect hashing function, ACM SIGPLAN Notices, v.17 n.9, p.18-27, September 1982 [doi>10.1145/947955.947957]
• 5: M. W. Du , T. M. Hsieh , K. F. Jea , D. W. Shieh, The Study of a New Perfect Hash Scheme, IEEE Transactions on Software Engineering, v.9 n.3, p.305-313, May 1983 [doi>10.1109/TSE.1983.236866]
• 6: Sakti P. Ghosh, Data base organization for data management (2nd ed.), Academic Press Professional, Inc., San Diego, CA, 1986
• 7: G. Jaeschke, Reciprocal hashing: a method for generating minimal perfect hashing functions, Communications of the ACM, v.24 n.12, p.829-833, Dec. 1981 [doi>10.1145/358800.358806]
• 8: Donald E. Knuth, The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1997
• 9: Ted G. Lewis , Curtis R. Cook, Hashing for Dynamic and Static Internal Tables, Computer, v.21 n.10, p.45-56, October 1988 [doi>10.1109/2.7056]
• 10: Ramakrishna, M. V. 1986 Perfect Hashing for External Files, Technical Report CS-86-25, Computer Science Sept., University of Waterloo.
• 11: Thomas J. Sager, A polynomial time generator for minimal perfect hash functions, Communications of the ACM, v.28 n.5, p.523-532, May 1985 [doi>10.1145/3532.3538]
• 12: Renzo Sprugnoli, Perfect hashing functions: a single probe retrieving method for static sets, Communications of the ACM, v.20 n.11, p.841-850, Nov. 1977 [doi>10.1145/359863.359887]

INDEX TERMS

Keywords:
Newton's interpolating polynomial, content databases, minerals exhibit, minimal perfect hashing function