Skip to main content
Springer Nature Link
Log in

BEAST: A Buffer Replacement Algorithm Using Spatial and Temporal Locality

  • Conference paper
Computational Science and Its Applications - ICCSA 2006 (ICCSA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3981))

Included in the following conference series:

  • 499 Accesses

Abstract

Efficient buffer management is closely related to system performance. Thus, much research has been performed on various buffer management techniques. However, many of the proposed techniques utilize the temporal locality of access patterns. In spatial database environments, there exists not only the temporal locality but also spatial locality, where the objects in the recently accessed regions will be accessed again in the near future. Thus, in this paper, we present a buffer management technique, called BEAST, which utilizes both the temporal locality and spatial locality in spatial database environments. The experimental results with real-life and synthetic data demonstrate the efficiency of BEAST.

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.

Similar content being viewed by others

References

  1. Brinkhoff, T., Kriegel, H., Scheneider, R., Seeger, B.: The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. In: Proceedings of ACM SIGMOD Conference, pp. 322–331 (1990)

    Google Scholar 

  2. Min, J.-K., Park, H.-H., Chung, C.-W.: Multi-way spatial join selectivity for the ring join graph. Information and Software Technology 47(12), 785–795 (2005)

    Article  Google Scholar 

  3. Papadias, D., Mamoulis, N., Theodoridis, Y.: Processing and Optimization of Multiway Spatial Join Using R-Tree. In: Proceedings of ACM PODS, pp. 44–55 (1999)

    Google Scholar 

  4. Effelsberg, W.: Principles of Database buffer Management. ACM TODS 9(4), 560–595 (1984)

    Google Scholar 

  5. O’Neil, E.J., Neil, P.E.O., Weikum, G.: The LRU-K Page Replacement algorithm for database disk buffering. In: Proceedings of ACM SIGMOD Conference, pp. 297–306 (1993)

    Google Scholar 

  6. Johnson, T., Shasha, D.: 2Q: a Low Overhead High Performance Buffer Management Replacement Algorithm. In: Proceedings of VLDB Conference, pp. 439–450 (1994)

    Google Scholar 

  7. Tung, A.J., Yay, Y.C., Lu, H.: BLOOM: Buffer Replacement using Online Optimization by Mining. In: Proceedings of CIKM, pp. 185–192 (1998)

    Google Scholar 

  8. Lee, J.C.D., Kim, J.H., Noh, S.H., Min, S.L., Cho, Y., Kim, C.S.: LRFU: A Spectrum of Policies that subsumes the Least Recently Used and Least Frequently Used Policies. IEEE Tans. Computers 50(12), 1352–1360 (2001)

    Article  MathSciNet  Google Scholar 

  9. Megiddo, N., Modha, D.S.: ARC: A Self-tuning, Low Overhead Replacement Cache. In: Proceedings of USENIX FAST Conference (2003)

    Google Scholar 

  10. Sokolinsky, L.B.: LFU-K: An Effective Buffer Management Replacement Algorithm. In: Lee, Y., Li, J., Whang, K.-Y., Lee, D. (eds.) DASFAA 2004. LNCS, vol. 2973, pp. 670–681. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  11. Juurlink, B.: Approximating the Optimal Replacement Algorithm. In: ACM CF Conference (2004)

    Google Scholar 

  12. Sacco, G.M.: Index Access with a Finite Buffer. In: Proceedings of VLDB Conference (1987)

    Google Scholar 

  13. Goh, C.H., Ooi, B.C., Sim, D., Tan, K.: GHOST: Fine Granularity Buffering of Index. In: Proceedings of VLDB Conference (1999)

    Google Scholar 

  14. Papadopoulos, A., Manolopoulos, Y.: Global Page Replacement in Spatial Databases. In: Proceedings of DEXA (1996)

    Google Scholar 

  15. Kamel, I., Faloutsos, C.: On Packing R-Trees. In: Proceedings of CIKM, pp. 490–499 (1993)

    Google Scholar 

  16. Brinkhoff, T.: A Robust and Self-tuning Page Replacement Strategy for Spatial Database Systems. In: Proceedings of DEXA, pp. 533–552 (2002)

    Google Scholar 

  17. Ki-Joune, L., Robert, L.: The Spatial Locality and a Spatial Indexing Method by Dynamic Clustering in Hypermap System. In: Proceedings of SSD, pp. 207–223 (1990)

    Google Scholar 

  18. Bureau, U.C.: UA Census, TIGER/Line Files (2000), http://www.census.gov/geo/www/tiger/tigerua/ua_tgr2k.html

Download references

Author information

Authors and Affiliations

  1. School of Internet-Media Engineering, Korea University of Technology and Education, Byeongcheon-myeon, Cheonan, Chungnam, 330-708, Republic of Korea

    Jun-Ki Min

Authors
  1. Jun-Ki Min
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina L. Gavrilova

  2. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. OptimaNumerics Ltd., Cathedral House, 23-31 Waring Street, BT1 2DX, Belfast, UK

    C. J. Kenneth Tan

  5. Clayton School of IT, Monash University, 3800, Clayton, Australia

    David Taniar

  6. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy

    Antonio Laganá

  7. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  8. School of Information and Communication Engineering, Sungkyunkwan University, Korea

    Hyunseung Choo

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Min, JK. (2006). BEAST: A Buffer Replacement Algorithm Using Spatial and Temporal Locality. In: Gavrilova, M.L., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3981. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751588_8

Download citation

  • DOI: https://doi.org/10.1007/11751588_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34072-0

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics