Abstract
We obtain average value and distribution estimates for the height of a class of trees that occurs in various contexts in computer algorithms : in trie searching, as index in several dynamic schemes and as an underlying partition structure in polynomial factorization algorithms. In particular, results given here completely solve the problem of analyzing Extendible Hashing for which practical conclusions are given. The treatment relies on the saddle point method of complex analysis which is used here for extracting coefficients of a probability generating function, and on a particular technique that reveals periodic fluctuations in the behaviour of algorithms which are precisely quantified.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cantor D.G. and Zassenhaus H.: “On Algorithms for Factoring Polynomials over Finite Fields”, Math. of Comp. 36 (1981)pp 587–592
De Bruijn N.G.: Asymptotic Methods in Analysis, North-Holland P.C., Amsterdam (1961)
David F.N. and Barton D.E., Combinatorial Chance, Charles Griffin, London (1962).
Fagin R., Nievergelt J., Pippenger N. and Strong H.R., “Extendible Hashing — A Fast Access Method for Dynamic Files”, ACM Trans. on Database System, 4 (1979) pp. 315–344.
Flajolet P. and Odlyzko A.: “The Average Height of Binary Trees and Other Simple Trees”, JCSS to appear
Gonnet G., “Expected Length of the Longest Probe Sequence in Hashing”, JACM 28 (1980) pp. 289–304
Henrici P., Applied and Computational Complex Analysis, Vol. 2, J. Wiley, New York (1978)
Knuth D.E.: The Art of Computer Programming, Vol. 2, Addison-Wesley, Reading (1969)
Knuth D.E., The Art of Computer Programming, Vol. 3, Addison-Wesley, Reading (1973).
Larson P.A., “Dynamic Hashing”, BIT 18 (1978) pp. 184–201.
Lazard D, “Factorisation des PolynÔmes”, in 4‡ Journées Algorithmiques, Poitiers (1981), also sumbitted for publication.
Litwin W., “Virtual Hashing: A Dynamically Changing Hashing”, in Proc. Very Large Data Bases Conf., Berlin (1978) pp. 517–523.
Mendelson H., “Extendible Hashing: Analysis for Design”, Rochester University Report nℴ 8019 (1980).
Regnier M., “On the Average Height of Trees in Digital Searching and Dynamic Hashing”, IPL (to appear).
Robson J.M.: “The Height of Binary Search Trees”, Austral. Comp. J. 11 (1979) pp 151–153.
Yao A., “A Note On the Analysis of Extendible Hashing”, IPL 11 (1980) pp. 84–86.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Flajolet, P., Steyaert, JM. (1982). A branching process arising in dynamic hashing, trie searching and polynomial factorization. In: Nielsen, M., Schmidt, E.M. (eds) Automata, Languages and Programming. ICALP 1982. Lecture Notes in Computer Science, vol 140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012773
Download citation
DOI: https://doi.org/10.1007/BFb0012773
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11576-2
Online ISBN: 978-3-540-39308-5
eBook Packages: Springer Book Archive