Skip to main content

The Impact of Buffering on Closest Pairs Queries Using R-Trees

  • Conference paper
  • First Online:
Advances in Databases and Information Systems (ADBIS 2001)

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

  • 257 Accesses

Abstract

In this paper, the most appropriate buffer structure, page replacement policy and buffering scheme for closest pairs queries, where both spatial datasets are stored in R-trees, are investigated. Three buffer structures (i.e. single, hybrid and by levels) over two buffering schemes (i.e. local to each R-tree, and global to the query) using several page replacement algorithms (e.g. FIFO, LRU, 2Q, etc.) are studied. In order to answer K closest pair queries (K-CPQs, with K ≥ 1) we employ recursive and non-recursive (iterative) branch-and-bound algorithms. The outcome of this study is the derivation of the outperforming configuration (in terms of buffer structure, page replacement algorithm and buffering scheme) for CPQs. In all cases, the savings in disk accesses is larger for a recursive algorithm than for a non-recursive one, in the presence of buffer space. Also, the global buffering scheme is more appropriate for small or medium buffer sizes for recursive algorithms, whereas the local scheme is the best choice for large buffers. If we use non-recursive algorithms, the global buffering scheme is the best choice in all cases. Moreover, LRU is the most appropriate page replacement algorithm for small or medium buffer sizes for both types of branch-and-bound algorithms. FIFO and LRU are the best choices for recursive algorithms and 2Q for the non-recursive ones, when the buffer is large enough.

On sabbatical leave from the Department of Informatics, Aristotle University, 54006 Thessaloniki, Greece. manolopo@csd.auth.gr

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. W. Bridge, A. Joshi, M. Keihl, T. Lahiri, J. Loaiza and N. MacNaughton: “The Oracle Universal Server Buffer”, Proc. 23rd VLDB Conf., pp. 590–594, Athens, Greece, 1997.

    Google Scholar 

  2. N. Beckmann, H.P. Kriegel, R. Schneider and B. Seeger: “The R*-tree: and Efficient and Robust Access Method for Points and Rectangles”, Proc. 1990 ACM SIGMOD Conf., pp. 322–331, Atlantic City, NJ, 1990.

    Google Scholar 

  3. T. Brinkhoff, H.P. Kriegel and B. Seeger: “Efficient Processing of Spatial Joins Using R-Trees”. Proc. 1993 ACM SIGMOD Conf., pp. 237–246, Washington, DC, 1993.

    Google Scholar 

  4. H.T. Chou and D.J. DeWitt: “An Evaluation of Buffer Management Strategies for Relational Database Systems”, Proc. 11th VLDB Conf., pp. 127–141, Stockholm, Sweden, 1985.

    Google Scholar 

  5. A. Corral, Y. Manolopoulos, Y. Theodoridis and M. Vassilakopoulos: “Closest Pair Queries in Spatial Databases”, Proc. 2000 ACM SIGMOD Conf., pp. 189–200, Dallas, TX, 2000.

    Google Scholar 

  6. C.Y. Chan, B.C. Ooi and H. Lu: “Extensible Buffer Management of Indexes”, Proc. 18th VLDB Conf., pp. 444–454, Vancouver, Canada, 1992.

    Google Scholar 

  7. A. Corral, M. Vassilakopoulos and Y. Manolopoulos: “Algorithms for Joining R-Trees and Linear Region Quadtrees”, Proc. 6th SSD Conf., pp. 251–269, Hong Kong, China, 1999.

    Google Scholar 

  8. A. Corral, M. Vassilakopoulos and Y. Manolopoulos: “The Impact of Buffering on Closest Pairs Queries using R-trees”, Technical Report, Dept. of Informatics, Aristotle University of Thessaloniki, February 2001.

    Google Scholar 

  9. W. Effelsberg and T. Harder: “Principles of Database Buffer Management”, ACM Transactions on Database Systems, Vol. 9, No. 4, pp. 560–595, 1984.

    Article  Google Scholar 

  10. A. Guttman: “R-trees: A Dynamic Index Structure for Spatial Searching”, Proc. 1984 ACM SIGMOD Conf., pp. 47–57, Boston, MA, 1984.

    Google Scholar 

  11. Y.W. Huang, N. Jing and E.A. Rundensteiner: “Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations”, Proc. 23rd VLDB Conf., pp. 396–405, Athens, Greece, 1997.

    Google Scholar 

  12. G.R. Hjaltason and H. Samet: “Incremental Distance Join Algorithms for Spatial Databases”, Proc. 1998 ACM SIGMOD Conf., pp. 237–248, Seattle, WA, 1998.

    Google Scholar 

  13. T. Johnson and D. Shasha: “2Q: a Low Overhead High Performance Buffer Management Replacement Algorithm”, Proc. 20th VLDB Conf., pp. 439–450, Santiago, Chile, 1994.

    Google Scholar 

  14. S.T. Leutenegger and M.A. Lopez: “The Effect of Buffering on the Performance of R-Trees”. Proc. ICDE Conf., pp. 164–171, Orlando, FL, 1998.

    Google Scholar 

  15. E.J. O’Neil, P.E. O’Neil and G. Weikum: “The LRU-K Page Replacement Algorithm for Database Disk Buffering”, Proc. 1993 ACM SIGMOD Conf., pp. 297–306, Washington, DC, 1993.

    Google Scholar 

  16. A. Papadopoulos and Y. Manolopoulos: “Global Page Replacement in Spatial Databases”, Proc. DEXA’96, Conf., pp. 855–864, Zurich, Switzerland, 1996.

    Google Scholar 

  17. A. Papadopoulos, P. Rigaux and M. Scholl: “A Performance Evaluation of Spatial Join Processing Strategies”, Proc. 6th SSD Conf., pp. 286–307, Hong Kong, China, 1999.

    Google Scholar 

  18. G.M. Sacco: “Index Access with a Finite Buffer”, Proc. 13th VLDB Conf., pp. 301–309, Brighton, England, 1987.

    Google Scholar 

  19. M. Stonebraker, J. Frew, K. Gardels and J. Meredith: “The Sequoia 2000 Benchmark”, Proc. 1993 ACM SIGMOD Conf., pp. 2–11, Washington, DC, 1993.

    Google Scholar 

  20. G.M. Sacco and M. Schkolnick: “A Mechanism for Managing the Buffer Pool in a Relational Database System Using the Hot Set Model”, Proc. 8th VLDB Conf., pp. 257–262, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Corral, A., Vassilakopoulos, M., Manolopoulos, Y. (2001). The Impact of Buffering on Closest Pairs Queries Using R-Trees. In: Caplinskas, A., Eder, J. (eds) Advances in Databases and Information Systems. ADBIS 2001. Lecture Notes in Computer Science, vol 2151. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44803-9_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-44803-9_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42555-7

  • Online ISBN: 978-3-540-44803-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics