Skip to main content
SpringerLink
Log in

Maintaining range trees in secondary memory

extended abstract

  • Contributed Papers
  • Conference paper
  • First Online:
STACS 88 (STACS 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 294))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.L. Bentley. Decomposable Searching Problems. Inform. Proc. Lett. 8 (1979), pp. 244–251.

    Google Scholar 

  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. 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. M.H. Overmars. The Design of Dynamic Data Structures. Springer Lecture Notes in Computer Science, Vol. 156, Springer Verlag, 1983.

    Google Scholar 

  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. F.P. Preparata and M.I. Shamos. Computational Geometry, an Introduction. Springer Verlag, 1985.

    Google Scholar 

  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. 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. 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 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Utrecht, P.O. Box 80.012, 3508 TA, Utrecht, The Netherlands

    Mark H. Overmars

  2. Department of Computer Science, University of Amsterdam, Nieuwe Achtergracht 166, 1018 WV, Amsterdam, The Netherlands

    Michiel H. M. Smid

Authors
  1. Mark H. Overmars
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michiel H. M. Smid
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Robert Cori Martin Wirsing

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Overmars, M.H., Smid, M.H.M. (1988). Maintaining range trees in secondary memory. In: Cori, R., Wirsing, M. (eds) STACS 88. STACS 1988. Lecture Notes in Computer Science, vol 294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035830

Download citation

  • DOI: https://doi.org/10.1007/BFb0035830

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18834-6

  • Online ISBN: 978-3-540-48190-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation