Perfect hashing functions.
| dc.advisor | James Lowell | en_US |
| dc.college | las | en_US |
| dc.contributor.author | Tidd, Phyllis May. | |
| dc.date.accessioned | 2012-08-01T16:08:27Z | |
| dc.date.available | 2012-08-01T16:08:27Z | |
| dc.date.created | 1987 | en_US |
| dc.date.issued | 2012-08-01 | |
| dc.department | mathematics, computer science, and economics | en_US |
| dc.description | 119 leaves | en_US |
| dc.description.abstract | This thesis will introduce the reader to the idea of using a hashing function for storage and retrieval of information. The history of how hashing functions originated is presented. Some different types of hashing functions are discussed. In particular this thesis presents a perfect hashing function. A perfect hashing function (phf) is an injection, F, from a set I of N objects into the set consisting of the first R non-negative integers where R l N. Perfect hashing functions are useful for the compact storage and fast retrieval of frequently used objects such as reserved words in a programming language. | en_US |
| dc.identifier.uri | http://hdl.handle.net/123456789/1961 | |
| dc.language.iso | en_US | en_US |
| dc.subject | Hashing (Computer science) | en_US |
| dc.subject | Algorithms. | en_US |
| dc.subject | File organization (Computer science) | en_US |
| dc.title | Perfect hashing functions. | en_US |
| dc.type | Thesis | en_US |