Skip to main content
SpringerLink
Log in

Global page replacement in spatial databases

  • Physical Aspects 2
  • Conference paper
  • First Online:
Database and Expert Systems Applications (DEXA 1996)

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

Included in the following conference series:

Abstract

In this paper we show how we can utilize a database buffer, when the underlying dataspace is organized by means of a spatial data structure and particularly R-trees. In such a case the Least Recently Used (LRU) page replacement policy is not powerful enough to guarantee efficiency, because it does not take into consideration important parameters of the structure, such as the portion (area) of the dataspace that each page occupies. Of course, the time period passed since the last reference of a page is still an important factor. Therefore, we combine several factors, in order to derive a more powerful caching algorithm. Experiments based on real and synthetic datasets, show that the new replacement algorithm performs better than LRU in many cases and also supports tuning.

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. N. Beckmann, H.P. Kriegel and B. Seeger: “The R*-tree: an efficient and robust method for points and rectangles”, Proceedings of the 1990 ACM SIGMOD Conference, pp.322–331, Atlantic City, NJ, 1990.

    Google Scholar 

  2. C. Y. Chan, B. C. Ooi and H. Lu: “Extensible buffer management of indexes”, Proceedings of the 18th VLDB Conference, pp.444–454, Vancouver, Canada 1992.

    Google Scholar 

  3. W. Effelsberg: “Principles of database buffer management”, ACM Transactions on Database Systems, vol.9, no.4, pp.560–595, 1984.

    Article  Google Scholar 

  4. J. Gray, S. Englert, K. Baclawski and P. Weinberger: “Quickly generating billion-record synthetic databases”, Proceedings of the 1994 ACM SIGMOD Conference, pp.243–252, Minneapolis, MN, 1994.

    Google Scholar 

  5. O. Gunther: “The design of the Cell tree: an object-oriented index structure for geometric databases”, Proceedings of the 5th IEEE Conference on Data Engineering, pp.598–615, Los Angeles, CA, 1989.

    Google Scholar 

  6. R.H. Guting: “An introduction to spatial database systems”, The VLDB Journal, vol.3, no.4, pp.357–399, 1994.

    Article  Google Scholar 

  7. A. Guttman: “R-trees: a dynamic index structure for spatial searching”, Proceedings of the 1984 ACM SIGMOD Conference, pp.47–57, Boston, MA, 1984.

    Google Scholar 

  8. A. Henrich, H.W. Six and P. Widmayer: “The LSD-tree: spatial access to multidimensional point and non-point objects”, Proceedings of the 15th VLDB Conference, pp.45–53, Amsterdam, Netherlands, 1989.

    Google Scholar 

  9. T. Johnson and D. Shasha: “2Q: a low overhead high performance buffer management replacement algorithm”, Proceedings of the 20th VLDB Conference, pp.439–450, Santiago, Chile, 1994

    Google Scholar 

  10. L Kamel and C. Faloutsos: “On packing R-trees”, Proceedings of the 2nd Conference on Information and Knowledge Management (CIKM), Washington DC, 1993.

    Google Scholar 

  11. L Kamel and C. Faloutsos: “Hilbert R-tree: an improved R-tree using fractals”, Proceedings of the 20th VLDB Conference, pp.500–509, Santiago, Chile, 1994.

    Google Scholar 

  12. R Laurini and D. Thompson: “Fundamentals of spatial information systems”, Academic Press, London, 1992.

    Google Scholar 

  13. K. I. Lin, H. V. Jagadish and C. Faloutsos: “The TV-tree: an index structure for high-dimensional data”, The VLDB Journal, vol.3, pp.517–542, 1994.

    Article  Google Scholar 

  14. E. J. O'Neil, P. E. O'Neil and Gerhard Weikum: “The LRU-K page replacement algorithm for database disk buffering”, Proceedings of the 1993 ACM SIGMOD Conference, pp.297–306, Washington DC, 1993.

    Google Scholar 

  15. B.U. Pagel, H.W. Six, H Toben and P. Widmayer: “Towards an analysis of range query performance in spatial data structures”, Proceedings of the 1993 ACM PODS Conference, pp.214–221, Washington DC, 1993.

    Google Scholar 

  16. N. Roussopoulos and D. Leifker: “Direct spatial search on pictorial databases using packed R-trees”, Proceedings of the 1985 ACM SIGMOD Conference, pp.17–31, Austin, TX, 1985.

    Google Scholar 

  17. H. Samet: “The design and analysis of spatial data structures”, Addison-Wesley, Reading, MA, 1990.

    Google Scholar 

  18. T. Sellis, N. Roussopoulos and C. Faloutsos: “The R+-tree: a dynamic index for multidimensional objects”, Proceedings of the 13th VLDB Conference, pp.507–518, Brighton, UK, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, Aristotle University, 54006, Thessaloniki, Greece

    Apostolos Papadopoulos & Yannis Manolopoulos

Authors
  1. Apostolos Papadopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yannis Manolopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Roland R. Wagner Helmut Thoma

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Papadopoulos, A., Manolopoulos, Y. (1996). Global page replacement in spatial databases. In: Wagner, R.R., Thoma, H. (eds) Database and Expert Systems Applications. DEXA 1996. Lecture Notes in Computer Science, vol 1134. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0034737

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-70651-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation