Abstract
Some heuristics for computing the character weights in a Cichelli-style, minimal perfect hashing function are given. These ideas should perform best when applied to relatively small, static sets of character strings and they can be used as the foundation for a large programming assignment. An example using the names of the fifty United States is given to illustrate how the weights are determined.
Publisher
Association for Computing Machinery (ACM)
Reference7 articles.
1. The study of an ordered minimal perfect hashing scheme
2. Minimal perfect hash functions made simple
3. [
3
] Everitt B. Cluster Analysis. Halsted Press 1980. [3] Everitt B. Cluster Analysis . Halsted Press 1980.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献