Abstract
Minimal perfect hashing provides a mapping between a set of n unique words and n consecutive numbers. When implemented with minimal finite-state automata, the mapping is determined only by the (usually alphabetical) order of words in the set. Addition of new words would change the order of words already in the language of the automaton, changing the whole mapping, and making it useless in many domains. Therefore, we call it static. Dynamic minimal perfect hashing assigns consecutive numbers to consecutive words as they are added to the language of the automaton. Dynamic perfect hashing is important in many domains, including text retrieval and databases. We investigate three methods for its implementation.
Invited professor at the University of Tours, October through November 2004
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Jan Daciuk, Stoyan Mihov, Bruce Watson, and Richard Watson. Incremental construction of minimal acyclic finite state automata. Computational Linguistics, 26(1):3–16, April 2000.
Lauri Karttunen. Constructing lexical transducers. In In Proc. of the 15th International Conference on Computational Linguistics, COLING’94, Kyoto, Japan, 1994.
Claudio Lucchiesi and Tomasz Kowaltowski. Applications of finite automata representing large vocabularies. Software Practice and Experience, 23(1):15–30, Jan. 1993.
Denis Maurel. Pseudo-minimal transducer. Theoretical Computer Science, (231):129–139, 2000.
Dominique Revuz. Dictionnaires et lexiques: méthodes et algorithmes. PhD thesis, Institut Blaise Pascal, Paris, France, 1991. LITP 91.44.
Strahil Ristov and Eric Laporte. Ziv Lempel compression of huge natural language data tries using suffix arrays. Journal of Discrete Algorithms, pages 241–256, 1999.
Bruce Watson. A fast new (semi-incremental) algorithm for the construction of minimal acyclic DFAs. In Third Workshop on Implementing Automata, pages 91–98, Rouen, France, September 1998. Lecture Notes in Computer Science.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Daciuk, J., Maurel, D., Savary, A. (2005). Dynamic Perfect Hashing with Finite-State Automata. In: Kłopotek, M.A., Wierzchoń, S.T., Trojanowski, K. (eds) Intelligent Information Processing and Web Mining. Advances in Soft Computing, vol 31. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-32392-9_18
Download citation
DOI: https://doi.org/10.1007/3-540-32392-9_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25056-2
Online ISBN: 978-3-540-32392-1
eBook Packages: EngineeringEngineering (R0)