Advertisement

Maintaining range trees in secondary memory

extended abstract
  • Mark H. Overmars
  • Michiel H. M. Smid
Contributed Papers Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 294)

Abstract

Range trees can be used for solving a number of problems in databases and other applications. We study the problem of storing range trees in secondary memory. To this end, we have to partition range trees into parts that can be stored in consecutive blocks in secondary memory. A number of partition schemes will be presented that limit the part sizes and the number of disk accesses necessary for performing updates and queries. Matching lower bounds will be proven as well.

Keywords

Main Memory Main Tree Range Query Search Path Secondary Memory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    J.L. Bentley. Decomposable Searching Problems. Inform. Proc. Lett. 8 (1979), pp. 244–251.Google Scholar
  2. [2]
    N. Blum and K. Mehlhorn. On the Average Number of Rebalancing Operations in Weight-Balanced Trees. Theor. Comp. Sci. 11 (1980), pp. 303–320.Google Scholar
  3. [3]
    G.S. Lueker. A Data Structure for Orthogonal Range Queries. Proc. 19-th Annual IEEE Symp. on Foundations of Computer Science, 1978, pp. 28–34.Google Scholar
  4. [4]
    M.H. Overmars. The Design of Dynamic Data Structures. Springer Lecture Notes in Computer Science, Vol. 156, Springer Verlag, 1983.Google Scholar
  5. [5]
    M.H. Overmars, M.H.M. Smid, M.T. de Berg and M.J. van Kreveld. Maintaining Range Trees in Secondary Memory, Part I: Partitions. Techn. Report FVI 87-14, Computer Science Department, University of Amsterdam, 1987.Google Scholar
  6. [6]
    F.P. Preparata and M.I. Shamos. Computational Geometry, an Introduction. Springer Verlag, 1985.Google Scholar
  7. [7]
    M.H.M. Smid and M.H. Overmars. Maintaining Range trees in Secondary Memory, Part II: Lower Bounds. Techn. Report FVI 87-15, Computer Science Department, University of Amsterdam, 1987.Google Scholar
  8. [8]
    M.H.M. Smid, L. Torenvliet, P. van Emde Boas and M.H. Overmars. Two Models for the Reconstruction Problem for Dynamic Data Structures. Techn. Report FVI 87-13, Computer Science Department, University of Amsterdam, 1987.Google Scholar
  9. [9]
    D.E. Willard and G.S. Lueker. Adding Range Restriction Capability to Dynamic Data Structures. Journal of the ACM 32 (1985), pp. 597–617.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Mark H. Overmars
    • 1
  • Michiel H. M. Smid
    • 2
  1. 1.Department of Computer ScienceUniversity of UtrechtUtrechtThe Netherlands
  2. 2.Department of Computer ScienceUniversity of AmsterdamAmsterdamThe Netherlands

Personalised recommendations