Parallel construction of minimal perfect hashing functions with neural networks
Author: 
Jin WangAuthors Info & Claims
Jin WangAuthors Info & ClaimsPages 265 - 271
Abstract
The seeking of minimal perfect hashing functions (MPHF) has a long history and conventional construction methods are sequential algorithms. To parallelize the MPHF construction, a new method using neural networks is proposed in this paper. It constructs a MPHF by training a massive array of neural nets, and the training tasks can be carried out simultaneously. As the total MPHF construction time is proportional to the key set size, the new method can be applied to build MPHFs for large key sets. In one experiment, a MPHF for a dictionary of 24,464 English words is constructed by training an array of 764 multilayered feedforward neural nets. Network training time is reduced by employing an incremental training procedure. Implementation issues concerning persistent object storage and retrieval are also discussed.
References
[1]
E. A. Fox, L. S. Heath, Q. F. Chen, and A. M. Daond, "Practical minimal perfect hash functions for large databases," Communications of The ACM, Vol. 35, No. 1, Jan 1992, pp.105-121.
[2]
G. V. Cormack, R. N. S. Horspool, and M. Kaiserswerth, "Practical perfect hashing,~ The Computer Jolrnal, 3/ol. 28, No. 1, 1985, pp.54- 58.
[3]
T. J. Sager, "A polynomial time generator for minimal perfect hash functions," Communication8 o/The A CM, Vol. 28, No. 5, May 1985, pp.523-532.
[4]
K. Mehlhorn, "On the program size of perfect and universal hash ftmctions,~ In Proceedings of the P.Srd IEEE S~mposi=m of Fo=ndations of Computer Science, 1982, pp.170-175.
[5]
Y. LeCun, B. Boser, J. S. Denker, D. Henderson, R. E. Howard, W. Hubbard, and L. D. 3ackel, "Handwritten Digit recognition: Application of neural network chips and automatic learning," IEEE Communication Magazine, November, 1989, pp.41-46.
[6]
J. Wang, J. S. N. Jean, "Automatic rule generation for machine-printed character recognition using multiple neural networks", In Proc. of IEEE late~atioHI Conference on S~stems Engineer~rig, August, 1991, pp.343-346.
[7]
K. T. Blac~well, T. P. Yogi, S. D. Hyman, G. S. Barbour, and D. L. Alkon, "A new approach to hand-written character recognition,~ Paflera Recognition, Vol. 25, No. 6, 1992, pp. 655-666.
[8]
G.A. Carpenter and S. Groesberg, "The ART of adaptive pattern recognition by a self-organizing neural network," Computer, March 1988, pp. 77- 88.
[9]
B. E. Bcmer, E. Sackinger, J. Bromley, Y. LeCun, and L. D. J a~kel, "Hardware requirements for neural netwozk pattern dusifiers~, IEEE Mirco, February, 1992, pp.32-40.
[10]
D. E. Rumelhm~, G. E. Hinten, and R. J. Williams, ~Le~g internal representation by error propagation,~ In Parallel Distributed Proceasing: Ezplomtioa in the Micrvstr~cture of cognition. Cambridge, MA: MIT Press, 1986.
[11]
M. L. Minsky, S. A. Papert, Perceptrvns: An Introduction to Compffitational GeometrF. (expanded edition), The MIT Press, Cambridge, 1988.
Index Terms
- Parallel construction of minimal perfect hashing functions with neural networks
Recommendations
Minimal perfect hashing: A competitive method for indexing internal memory
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values. Since no collisions occur, each key can be retrieved from a hash table with a single probe. A minimal perfect hash function (MPHF) is a PHF with the ...
Minimal gated unit for recurrent neural networks
Recurrent neural networks (RNN) have been very successful in handling sequence data. However, understanding RNN and finding the best practices for RNN learning is a difficult task, partly because there are many competing and complex hidden units, such ...
Granular neural networks
Fuzzy neural networks (FNNs) and rough neural networks (RNNs) both have been hot research topics in the artificial intelligence in recent years. The former imitates the human brain in dealing with problems, the other takes advantage of rough set theory ...
Comments
Information & Contributors
Information
Published In
Copyright © 1993 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 March 1993
Check for updates
Qualifiers
- Article
Conference
CSC93
Sponsor:
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 587Total Downloads
- Downloads (Last 12 months)17
- Downloads (Last 6 weeks)1
Reflects downloads up to 18 Aug 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in