论文信息 - Thresholds and optimal binary comparison search trees

Thresholds and optimal binary comparison search trees

We present an O(n4)-time algorithm for the following problem: Given a set of items with known access frequencies, find the optimal binary search tree under the realistic assumption that each comparison can only result in a two-way decision: either an equality comparison or a less-than comparisons. This improves the best known result of O(n5) time, which is based on split tree algorithms. Our algorithm relies on establishing thresholds on the frequency of an item that can occur as an equality comparison at the root of an optimal tree.

[1] Donald E. Knuth,et al. The art of computer programming, volume 3: (2nd ed.) sorting and searching , 1998 .

[2] B. A. Sheil,et al. Median split trees: a fast lookup technique for frequently occuring keys , 1978, CACM.

[3] T. C. Hu,et al. Optimal Computer Search Trees and Variable-Length Alphabetical Codes , 1971 .

[4] Yehoshua Perl,et al. Optimum Split Trees , 1984, J. Algorithms.

[5] Chak-Kuen Wong,et al. Faster Construction of Optimal Binary Split Trees , 1986, J. Algorithms.

[6] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[7] Sampath Kannan,et al. Thresholds and Optimal Binary Comparison Search Trees , 2001, FSTTCS.

[8] Adriano M. Garsia,et al. A New Algorithm for Minimum Cost Binary Trees , 1977, SIAM J. Comput..

[9] Craig Chambers,et al. Efficient multiple and predicated dispatching , 1999, OOPSLA '99.

[10] Donald E. Knuth,et al. Sorting and Searching , 1973 .

[11] Chak-Kuen Wong,et al. Optimal Binary Split Trees , 1984, J. Algorithms.