Abstract
Split trees are suitable data structures for storing records with different access frequencies. Under assumption that the access frequencies are all distinct, Huang has proposed anO(n 4 logm) time algorithm to construct an (m+1)-way split tree for a set ofn keys. In this paper, we generalize Huang's algorithm to deal with the case of non-distinct access frequencies. The technique used in the generalized algorithm is a generalization of Hesteret al.'s, where the binary case was considered. The generalized algorithm runs inO(n 5 logm) time.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
L. Gotlieb,Optimal multiway search trees, SIAM Journal on Computing, vol. 10, no. 3, (1981), 422–433.
J. H. Hester, D. S. Hirschberg, S.-H. S. Huang and C. K. Wong,Faster construction of binary split trees, Journal of Algorithms, vol. 7, no. 3, (1986), 412–424.
S.-H. S. Huang and C. K. Wong,Optimal binary split trees, Journal of Algorithms, vol. 5, no. 1, (1984), 69–79.
S.-H. S. Huang,Optimal multiway split trees, Journal of Algorithms, vol. 8, no. 1 (1987), 146–156.
D. E. Knuth,Optimal binary search trees, Acta Informatica, vol. 1, no. 1, (1971), 14–25.
Y. Perl,Optimum split trees, Journal of Algorithms, vol. 5, no. 3, (1984), 367–374.
B. A. Sheil,Median split trees: a fast lookup technique for frequently occurring keys, Communications of the ACM, vol. 21, no. 11, (1978), 947–958.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Liu, L.T., Chen, GH. & Wang, YL. A note on optimal multiway split trees. BIT 31, 220–229 (1991). https://doi.org/10.1007/BF01931282
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01931282