skip to main content
10.1145/1516241.1516251acmconferencesArticle/Chapter ViewAbstractPublication PagesicuimcConference Proceedingsconference-collections
research-article

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

Published: 15 February 2009 Publication History

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]
Chang, C. C., 1984 The Study of an Ordered Minimal Perfecting Scheme, Comm. ACM, Vol.27, No.4, 384--387.
[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]
Cichelli, R. 1980 Minimal Perfect Hash Functions Made Simple. Comm. ACM, Vol.23, No.1, Jan, 17--19.
[4]
Cook, C. R. and Oldehoeft, R. 1982 A Letter-Oriented Minimal Perfect Hashing Function, ACM SIGPlan Notices, Vol. 17, No.9 Sept. 18--27.
[5]
Du, M, W., Hsieh, T. M., Jea, K. F. and Shieh, D. W. 1983 The Study of New Perfect Hash Scheme, IEEE Trans. Software Eng., Vol. SE-9, May, .305--313.
[6]
Ghosh, S. P. 1977 Data Base Organization for Data Management, Academic Press, New York, N. Y., 148--151.
[7]
Jaeshke, G. 1981 Reciprocal Hashing: A Method for Generating Minimal Perfect hashing Function, Comm. ACM, Vol.24, No.12, 829--833.
[8]
Knuth, D. E. 1980 The Art of Computer Programming Vol.2: Seminumerical Algorithm, Second Edition, Addision-Wesley, Reading, Mass.
[9]
Lewis, T. G. and Cook, C. R. 1988 Hashing for Dynamic and STatic Internal Tables, Computer, Vol.21, No.10, .45--56.
[10]
Ramakrishna, M. V. 1986 Perfect Hashing for External Files, Technical Report CS-86-25, Computer Science Sept., University of Waterloo.
[11]
Sager, T. 1985 A Polynomial Time Generatorfpr Minimal Perfect Hash Functions, Comm ACM, Vol.28, No.5, 523--532.
[12]
Sprugnoli, R. .1977 Perfect Hashing Functions: A Single Probe Retrieving Methods for STatic Sets, Comm. ACM, Vol.20, No.11, 841--850.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
ICUIMC '09: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
February 2009
704 pages
ISBN:9781605584058
DOI:10.1145/1516241
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 15 February 2009

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Newton's interpolating polynomial
  2. content databases
  3. minerals exhibit
  4. minimal perfect hashing function

Qualifiers

  • Research-article

Conference

ICUIMC '09
Sponsor:

Acceptance Rates

Overall Acceptance Rate 251 of 941 submissions, 27%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 80
    Total Downloads
  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)0
Reflects downloads up to 13 Feb 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media