A note on optimal multiway split trees
Part I Computer Science
Received:
Revised:
- 26 Downloads
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(n4 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(n5 logm) time.
CR categories
E.1 I.1.2Keywords
Split tree dynamic programmingPreview
Unable to display preview. Download preview PDF.
References
- [1]L. Gotlieb,Optimal multiway search trees, SIAM Journal on Computing, vol. 10, no. 3, (1981), 422–433.Google Scholar
- [2]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.Google Scholar
- [3]S.-H. S. Huang and C. K. Wong,Optimal binary split trees, Journal of Algorithms, vol. 5, no. 1, (1984), 69–79.Google Scholar
- [4]S.-H. S. Huang,Optimal multiway split trees, Journal of Algorithms, vol. 8, no. 1 (1987), 146–156.Google Scholar
- [5]D. E. Knuth,Optimal binary search trees, Acta Informatica, vol. 1, no. 1, (1971), 14–25.Google Scholar
- [6]Y. Perl,Optimum split trees, Journal of Algorithms, vol. 5, no. 3, (1984), 367–374.Google Scholar
- [7]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.Google Scholar
Copyright information
© BIT Foundations 1991