Abstract
This paper considers a classical binary tree implementation of a set of keys: the trie. The trie size properties in a static environment are well known: the size is asymptotically Gaussian when the keys number gets large. In this paper we analyze the trie in a dynamic environment, where the trie is allowed to grow and shrink in a probabilistic way. It appears that the trie size can be described by a stochastic process which is asymptotically non-Markovian Gaussian. This also allows the complete asymptotic analysis of the trie size maximum and the trie size integrated cost.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Csaki, E., Földes, A. and Salminen, P. On the Joint Distribution of the Maximum and its Location for a. Linear Diffusion; Ann. lust. Henri Poincaré, 1987, 23, 2, 179–194.
Daniels, H.E. andSicyrme, T.H.R. The Maximum of a Random Walk whose Mean Path has a Maximum; Adv. Appi. Prob., 1985, 17, 85–99.
Daniels, H.E. The Maximum of a Gaussian Process whose mean Path has a Maximum, with an Application to the Strength of Bundles of Fibres; Adv. Appl. Prob., 1989, 21, 315–333.
Durbin, J. The First-Passage Density of a Continuous Gaussian Process to a General Boundary; J. Appl. Prob., 1985, 22, 99–122.
Flajolet, Ph., Regnier, M., Sedgewick, R., Some uses of the Mellin integral transfrom in the analysis of algorithms, INRIA - Rapport de recherche 398, Mai 1985.
Flajolet, Ph., Puech, C. and Vuillemin, J. The Analysis of Simple List Structures, Inform. Sci., 1986, 38, 121–146.
Flajolet, Ph., Françon, J. and Vuillemin, J. Sequence of operations analysis for dynamic data structures, J. Algorithms, 1980, 1, 111–141.
Jacquet, P. and Regnier, M., Limiting distributions for trie parameters; INRIA, Report 502.
Jacquet, P. and Regnier, M., Trie partitioning process: limiting distributions; Proceedings CAAP'86, LNCS 214, 196–210.
Johnson, N.L. and Kotz, S., Urn models and their application; Wiley, 1977.
Louchard, G., Random walks, Gaussian processes and list structures; TCS, 1987, 53, 99–124.
Louchard, G., Brownian Motion and algorithms complexity; B.I.T., 1986, 26, 17–34.
Louchard, G., Schott, R. and Randrianarimanana, B. Dynamic Algorithms in D.E. Knuth's Model: a Probabilistic Analysis; Theor. Comp. Sc., 1992, 93, 201–225.
Louchard, G., Schott, R. Probabilistic analysis of some distributed algorithms; Proceedings CAAP'90, LNCS 431, 239–253 and Random Structures and Algorithms, 1991, 2, 2, 151–185.
Louchard, G. Trie size in a dynamic list structure, Laboratoire d'Informatique Théorique, TR-252, 1992.
Pittel, B., Paths in a random digital tree: limiting distributions; Adv. Appl. Prob., 1986, 18, 139–155.
Regnier, M. and Jacquet, P., New results on the size of tries; IEEE-Tr. Inf. Theor., 1989, 35, 1, 203–205.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Louchard, G. (1993). Trie size in a dynamic list structure. In: Gaudel, M.C., Jouannaud, J.P. (eds) TAPSOFT'93: Theory and Practice of Software Development. CAAP 1993. Lecture Notes in Computer Science, vol 668. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56610-4_100
Download citation
DOI: https://doi.org/10.1007/3-540-56610-4_100
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56610-6
Online ISBN: 978-3-540-47598-9
eBook Packages: Springer Book Archive