| dc.contributor.author | Tao, Qizhi | |
| dc.date.accessioned | 2014-09-29T15:05:25Z | |
| dc.date.available | 2014-09-29T15:05:25Z | |
| dc.date.issued | 1999-07-01 | |
| dc.identifier.uri | https://hdl.handle.net/11244/11873 | |
| dc.description.abstract | This study was conducted to compare two minimal perfect hashing method Chang's method and Jaeschke's method. Since hashing is a widely used technique for store data in symbol table and the data are strings of characters, this study f use on the performance of these methods with the letter-oriented set and gives their run time performance curves. Through the analysis of run time and space complexity, an optimal method is given to make each algorithm performance well. | |
| dc.format | application/pdf | |
| dc.language | en_US | |
| dc.publisher | Oklahoma State University | |
| dc.rights | Copyright is held by the author who has granted the Oklahoma State University Library the non-exclusive right to share this material in its institutional repository. Contact Digital Library Services at lib-dls@okstate.edu or 405-744-9161 for the permission policy on the use, reproduction or distribution of this material. | |
| dc.title | Comparison of Perfect Hashing Methods | |
| dc.type | text | |
| osu.filename | Thesis-1999-T171c.pdf | |
| osu.accesstype | Open Access | |
| dc.type.genre | Thesis | |
