Graduate Project
 

Minimal perfect hash tables environments

Public Deposited

Downloadable Content

Download PDF
https://ir.library.oregonstate.edu/concern/graduate_projects/5d86p710s

Descriptions

Attribute NameValues
Creator
Abstract
  • Cichelli gave a simple machine independent minimal perfect hashing function for small static sets. The hash function value for a word is computed as the sum of the length of the word and the values associated with the first and last letters of the word. Cichelli's algorithm (word-oriented) to find the letter value assignments considered the words one at a time. Cook and Oldehoeft developed a letter-oriented algorithm that considered groups of words in finding the letter value assignments. It outperformed Cichelli's algorithm. In this paper we present some characteristics of sets of words that cause problems for the letter-oriented algorithm. The major result is a new algorithm that finds separate letter value assignments for the first and last letter sets. It outperformed the letter-oriented algorithm for all data sets. Because it is faster and less restrictive, the new algorithm facilitates partitioning large data sets into smaller sets.
Resource Type
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Academic Affiliation
Rights Statement
Publisher
Peer Reviewed
Language

Relationships

Parents:

This work has no parents.

Items

Thumbnail Title Date Uploaded Visibility Actions
file details Ngern_Pin_Ouen_1982_12_15.pdf 2022-12-28 Public Download