Abstract
Parameters of time-space efficiency and sparseness of nodes in trees with adaptive multidigit branching are studied. Both precise and asymptotic expressions, describing average behavior of these parameters in a memoryless model, are obtained. These expressions are used to establish a relation between parameters. As a result, conditions of time-space optimality of trees constructed with the use of Nilsson and Tikkanen algorithm are obtained.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
E. Fredkin, “Trie memory,” Comm. ACM, No. 3, 490-500 (1960).
D. Knuth, The Art of Computer Programming [Russian translation], Mir, Moscow (1978).
R. Sedgewick and P. Flajolet, An Introduction to the Analysis of Algorithms, Addison Wesley, Reading (MA) (1996).
L. Devroye, “A note on the average depths in tries,” SIAM J. Comput., No 28, 367-371 (1982).
P. Flajolet and R. Sedgewick, “Digital search trees revisited,” SIAM J. Comput., No. 15, 748-767 (1986).
P. Jacquet and M. Regnier, “Trie partitioning process: limiting distributions,” Lect. Notes Comp. Sci., 214, 196-210 (1986).
B. Pittel. “Paths in a random digital tree: limiting distributions,” Adv. Appl. Probab., 18, 139-155 (1986).
P. Kirschenhofer and H. Prodinger, “Some further results on digital search trees,” Lect. Notes Comp. Sci., 229, 177-185 (1986).
W. Szpankowski, “Some results on V-ary asymmetric tries,” J. Algorithms, No. 9, 224-244 (1988).
P. Jacquet and W. Szpankowski, “Analysis of digital trees with Markovian dependency,” IEEE Trans. Inform. Theory, No. 37, 1470-1475 (1991).
W. Szpankowski, Average Case Analysis of Algorithms on Sequences, John Wiley and Sons, New York (2001).
A. Andersson and S. Nilsson, “Improved behavior of tries by adaptive branching,” Inform. Proc. Letters, No. 46, 295-300 (1993).
S. Nilsson and M. Tikkanen, “An experimental study of compression methods for dynamic tries,” Algorithmica, 33(1), 19-33 (2002).
Yu. A. Reznik, “Some results on tries with adaptive branching,” Theoretic Comp. Sci., 289(2), 1009-1026 (2002).
B. Pittel, “Asymptotic growth of a class of random trees,” Ann. Probab., No. 18, 414-427 (1985).
A. Andersson and S. Nilsson, “Faster searching in tries and quadtries — an analysis of level compression,” in: Proc. 2nd Ann. Eur. Symp. on Algorithms (ESA' 94), Utrecht, the Netherlands (1994), pp. 82-93.
S. Nilsson and M. Tikkanen, “Implementing a dynamic compressed trie,” in: Proc. 2nd Workshop on Algorithm Eng. (WAE' 98), Saarbruecken, Germany (1998), pp. 25-36.
W. Dobosiewitz, “Sorting by distributive partitioning,” Inform. Proc. Letters, No. 7(1), 1-6 (1978).
G. Ehrlich, “Searching and sorting real numbers,” J. Algorithms, No. 2, 1-14 (1981).
M. Tamminen, “Analysis of N-trees,” Inform. Proc. Letters, No. 16, 131-137 (1983).
H. Mahmoud, P. Flajolet, P. Jacquet, and M. Regnier, “Analytic variations on bucket selection and sorting,” Acta Informatica, No. 36(9/10), 735-760 (2000).
M. Hofri, Analysis of Algorithms: Computational Methods and Mathematical Tools, Oxford Univ. Press, New York (1995).
T. M. Cover and J. M. Thomas, Elements of Information Theory, John Wiley and Sons, New York (1991).
M. Abramovich and I. Stigan (eds.), A Manual on Special Functions [in Russian], Nauka, Moscow (1979).
N. G. de Bruijn, Asymptotic Methods in Analysis, Dover, New York (1981).
B. Van der Waerden, “On the Method of Saddle Points,” Appl. Sci. Res., B2, 33-45 (1951).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Reznik, Y.A. On Time-Space Efficiency of Digital Trees with Adaptive Multidigit Branching. Cybernetics and Systems Analysis 39, 152–162 (2003). https://doi.org/10.1023/A:1023837529522
Issue Date:
DOI: https://doi.org/10.1023/A:1023837529522