Self-adjusting augmented search trees
We consider the problem of maintaining a dynamic weighted binary search tree augmented with a secondary search structure. Although we show that partial rebuilding cannot simultaneously achieve optimal search and update times, we introduce a new technique related to partial building called weighted partial rebuilding, which supports optimal worst-case search times (within a constant factor) for primary keys, O(log n) amortized update times, and efficient amortized reweight times. We also give an example application.
Unable to display preview. Download preview PDF.
- 1.C. R. Aragon and R. G. Seidel. Randomized search trees. In Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, pages 540–545, 1989.Google Scholar
- 2.S. W. Bent, D. D. Sleator, and R. E. Tarjan. Biased search trees. SIAM Journal on Computing, 14:545–568, 1985.Google Scholar
- 3.V. Estivill-Castro and M. Sherk. Competitiveness and response time in on-line algorithms. In Proceedings of the 2nd International Symposium on Algorithms, pages 284–293, 1991.Google Scholar
- 4.G. Frederickson and S. Rodger. A new approach to the dynamic maintenance of maximal points in the plane. In Proceedings of the 25th Annual Allerton Conference on Communication, Control, and Computing, pages 879–888, 1987.Google Scholar
- 6.T. W. Lai and D. Wood. Adaptive heuristics for binary search trees and constant linkage cost. In Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, pages 72–77, 1991.Google Scholar