Summary
When storing and maintaining a data structure in secondary memory it is important to partition it into parts such that each query and update passes through a small number of parts. In this way the number of disk accesses and the amount of data transport required can be kept low. In Part I of this paper a number of partition schemes were given for partitioning range trees. In this paper we study lower bounds for partitions. In this way we prove that many of the partitions given in Part I are optimal.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bentley, J.L.: Decomposable searching problems. Inform. Proc. Lett. 8, 244–251 (1979)
Lueker, G.S.: A data structure for orthogonal range queries. Proc. 19th Annual IEEE Symp. on Foundations of Computer Science, pp. 28–34, 1978
Overmars, M.H., Smid, M.H.M., de Berg, M.T., van Kreveld, M.J.: Maintaining range trees in secondary memory, part I: Partitions. Report FVI-87-14, University of Amsterdam, 1987. Acta Inf. 27, 399–428
Smid, M.H.M., Torenvliet, L., van Emde Boas, P., Overmars, M.H.: Two models for the reconstruction problem for dynamic data structures. J. Inf. Process. Cybern. EIK 25, 131–155 (1989)
Willard, D.E., Lueker, G.S.: Adding range restriction capability to dynamic data structures. J. ACM 32, 597–617 (1985)
Author information
Authors and Affiliations
Additional information
Supported by the Netherlands Organization for Scientific Research (NWO)
Rights and permissions
About this article
Cite this article
Smid, M.H.M., Overmars, M.H. Maintaining range trees in secondary memory. Acta Informatica 27, 453–480 (1990). https://doi.org/10.1007/BF00289019
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00289019