Summary
Range trees are used for solving the orthogonal range searching problem, a problem that has applications in e.g. databases and computer graphics. We study the problem of storing range trees in secondary memory. To this end, we partition range trees into parts that are stored in consecutive blocks in secondary memory. This paper gives a number of partition schemes that limit the part-sizes and the number of disk accesses necessary to perform updates and queries. We show e.g., that for each fixed positive integer k, there is a partition of a two-dimensional range tree into parts of size O(n 1/k), such that each update requires at most k(2k+1) disk accesses, and each query requires at most 8k 2+2k+2t disk accesses, where t is the number of answers to the range query.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bayer, R., McCreight, E.M.: Organisation and Maintenance of Large Ordered Indexes. Acta Inf. 1, 173–189 (1972)
Bentley, J.L.: Decomposable Searching Problems. Inform. Proc. Lett. 8, 244–251 (1979)
Blum, N., Mehlhorn, K.: On the Average Number of Rebalancing Operations in Weight-Balanced Trees. Theor. Comput. Sci. 11, 303–320 (1980)
Comer, D.: The Ubiquitous B-tree. Comput. Surv. 11, 121–137 (1979)
Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics. Reading, Mass.: Addison-Wesley 1989
Hinrichs, K.: The Grid File System: Implementation and Case Studies of Applications. ETH Zürich: PhD Thesis 1985
Hinrichs, K.: Implementation of the grid file: design concepts and experience. BIT 25, 569–592 (1985)
Lueker, G.S.: A Data Structure for Orthogonal Range Queries. Proc. 19-th Annual IEEE Symp. on Foundations of Computer Science, pp. 28–34, 1978
Nievergelt, J., Hinterberger, H., Sevcik, K.C.: The Grid File: An Adaptable, Symmetric Multikey File Structure. ACM Trans. Database Syst. 9, 38–71 (1984)
Nievergelt, J., Reingold, E.M.: Binary Search Trees of Bounded Balance. SIAM J. Comput. 2, 33–43 (1973)
Overmars, M.H.: The Design of Dynamic Data Structures. Lect. Notes Comput. Sci., vol. 156. Berlin Heidelberg New York: Springer 1983
Preparata, F.P., Shamos, M.I.: Computational Geometry, an Introduction. Berlin Heidelberg New York: Springer 1985
Smid, M.H.M.: Dynamic Data Structures on Multiple Storage Media. University of Amsterdam: PhD Thesis 1989
Smid, M.H.M., Overmars, M.H.: Maintaining Range Trees in Secondary Memory, Part II: Lower Bounds. Report FVI-87-15, University of Amsterdam, 1987. Acta Inf. 27, 429–456
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)
Partially supported by the Netherlands Organization for Scientific Research (NWO)
Rights and permissions
About this article
Cite this article
Overmars, M.H., Smid, M.H.M., de Berg, M.T. et al. Maintaining range trees in secondary memory. Acta Informatica 27, 423–452 (1990). https://doi.org/10.1007/BF00289018
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00289018