Abstract
Recently a colleague wanted to include a section on perfect hashing functions in the latest edition of a book [4], and after an on-line search brought up a reference of mine [8], he sent me an email asking if I could generate a minimal perfect hashing function (MPHF) for the set of reserved words in Ada 2005. This is a summary of the process that determined one.
- Brain and Tharp, Near-Perfect Hashing of Large Word Sets, Software Practice and Experience, Volume 19, #10, 1989. Google Scholar
Digital Library
- Cichelli, Minimal Perfect Hashing Functions Made Simple, Communications of the ACM, Volume 23, #1, 1980. Google Scholar
Digital Library
- Czech, Havas, and Majewski, An optimal algorithm for generating minimal perfect hash functions, Information Processing Letters, Volume 43, 1992. Google Scholar
Digital Library
- Dale and McCormick, Ada 2005 Plus Data Structures: An Object-Oriented Approach, Jones and Bartlett, 2nd edition (not yet released - expected 2006). Google Scholar
Digital Library
- Fox, Heath, Chen and Daoud, Practical Minimal Perfect Hash Functions for Large Databases, Communications of the ACM, Volume 35, #1, 1992. Google Scholar
Digital Library
- Sebesta and Taylor, Fast Identification of Ada and Modula-2 Reserved Words, Journal of Pascal, Ada and Modula-2, March/April 1986. Google Scholar
Digital Library
- Trono, An Undergraduate Project to Compute Minimal Perfect Hashing Functions, SIGCSE Bulletin, Volume 24, #3, 1992. Google Scholar
Digital Library
- Trono, A Comparison of Three Strategies for Computing Minimal Perfect Hashing Functions, SIGPLAN Notices, Volume 27, #11, 1992.Google Scholar
Index Terms
Optimal table lookup for reserved words in Ada
Recommendations
A perfect hash function for Ada reserved words
A fast perfect hash function is presented which allows the 63 Adat reserved words to be differentiated quickly from other Ada identifiers. Such functions are potentially useful in improving the performance of software that processes the text of Ada ...
Performance Analysis of Non-cryptographic Hash Functions for Real-Time Storage and Lookup of URLs
FIT '13: Proceedings of the 2013 11th International Conference on Frontiers of Information TechnologyIn this work, the performance of various non-cryptographic hash functions has been investigated to identify their random nature when employed in the implementation of hash tables for real-time storage and lookup of uniform resource locators. The ...
Optimal XOR hashing for a linearly distributed address lookup in computer networks
ANCS '05: Proceedings of the 2005 ACM symposium on Architecture for networking and communications systemsHashing algorithms have been widely adopted to provide a fast address look-up process which involves a search through a large database to find a record associated with a given key. Modern examples include address-lookup in network routers for a ...






Comments