Skip Navigation

The Computer Journal 1985 28(1):54-58; doi:10.1093/comjnl/28.1.54
© 1985 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (10)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Cormack, G. V.
Right arrow Articles by Kaiserswerth, M.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Practical Perfect Hashing

G. V. Cormack1 *, R. N. S. Horspool2 § and M. Kaiserswerth3 ¶

1 Department of Computer, Science, University of Waterloo, Ontario, Canada,, 2 Department of Computer Science, University of Victoria, Box 1700, Victoria, Canada, 3 Universitat Erlangen, IMMD IV, Martensstrasse 3, Erlangen, Germany

A practical method is presented that permits retrieval from a table in constant time. The method is suitable for large tables and consumes, in practice, O(n) space for n table elements. In addition, the table and the hashing function can be constructed in O(n) expected time. Variations of the method that offer different compromises between storage usage and update time are presented.


* Present address and address for correspondence: Department of Computer, Science, University of Waterloo, Waterloo, Ontario N2L 3G1.

§ Present address: Department of Computer Science, University of Victoria, Box 1700, Victoria, B.C.V8W 2Y2.

Present address: Universität Erlangen, IMMD IV, Martensstrasse 3, 8520 Erlangen, Fedral Republic of Germany.

{ddagger} School of Computer Science, McGill University


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.