Abstract
In this paper we study the efficiency of general methods for converting static data structures to dynamic structures. The efficiency is measured in terms of two quantities: query time and update time penalty factors. We provide lower bounds on the trade-off between these quantities and show certain known transforms to be essentially optimal.
Similar content being viewed by others
References
J. L. Bentley, “Decomposable Searching Problems,”Information Processing Letters 8 (5), 244–251 (1979).
K. Mehlhorn and M. H. Overmars, Optimal Dynamization of Decomposable Searching Problems, FB 10, Universität des Saarlandes, Techn. Report No. A 80/15, to appear in Information Processing Letters.
M. H. Overmars and v. Leeuwen, Two general methods for dynamizing decomposable searching problems, Techn. Report University of Utrecht, RUU-SC-79–10, Nov. 79.
J. L. Bentley and J. B. Saxe, Decomposable Searching Problems I. Static-to-Dynamic Transformation, Journal of Algorithms 1, 301–358 (1980).
J. van Leeuwen and D. Wood, Dynamization of Decomposable Searching Problems, Information Processing Letters 10, 51–56 (1980).
D. E. Willard, Balanced Forests ofk-d Trees as a Dynamic Data Structure, Harvard Aiken Computer Lab. Report, TR-23–78.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Mehlhorn, K. Lower bounds on the efficiency of transforming static data structures into dynamic structures. Math. Systems Theory 15, 1–16 (1981). https://doi.org/10.1007/BF01786969
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01786969