공간 시간 근접성을 이용한 효율적인 버퍼 관리 기법
An Efficient Buffer Management Technique Using Spatial and Temporal Locality
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
효율적인 버퍼 관리는 시스템의 성능과 밀접한 관련이 있다. 따라서 다양한 버퍼 관리 기법들에 대한 많은 연구가 진행되어 왔다. 그러나 많은 제안된 기법들의 대부분은 시간 근접성만을 고려하고 있다. 공간 데이터베이스와 같은 환경에서는 시간 근접성뿐 만 아니라, 유사한위치에 있는 공간 객체들은 서로 같이 접근 될 가능성이 높다는 공간 근접성도 존재한다. 따라서, 본 논문에서는 공간 데이터베이스 환경에서 시간 근접성과 공간 근접성을 같이 효과적으로 고려하는 버퍼 관리 기법인BEAT를 제안한다. 실제 데이터와 가상 데이터를 이용한 실험 결과는 BEAT의 효율성을 보인다.
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 BEAT, 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 BEAT.
참고문헌 (19)
- R.H.Guting, "Introduction to Spatial Databases Systems", VLDB, 3, pp.357~399 (1994)
- T. Brinkhoff, "The R*-tree: An Efficient and Robust Access Method for Points and Rectangles", proceedings of ACM SIGMOD Conference, pp.322~331 (1990)
- J.K. Min, "Multi-way spatial join selectivity for the ring join graph", Information and Software Technology, 47(12), pp.785~795 (2005)
- A. Papadopoulos, "Global Page Replacement in Spatial Databases", proceedings of DEXA (1996)
- W. Effelsberg, "Principles of Database buffer Management", ACM TODS, 9(4), pp.560~595 (1984)
- E. J. O’Neil, "The LRU-K Page Replacement algorithm for database disk buffering", proceedings of ACM SIGMOD, pp.297~306 (1993)
- T. Johnson, "2Q: a Low Overhead High Performance Buffer Management Replacement Algorithm", proceedings of VLDB Conference, pp.439~450 (1994)
- A.J. Tung, "BROOM: Buffer Replacement using Online Optimization by Mining", proceedings of CIKM, pp.185~192 (1998)
- D. Lee, "LRFU: A Spectrum of Policies that subsumes the Least Recently Used and Least Frequently Used Policies", IEEE Trans. Computers, 50(12), pp.1352~1360 (2001)
- N. Megiddo, "ARC: A Self-tuning, Low Overhead Replacement Cache", proceedings of USENIX FAST Conference (2003)
- L. B. Sokolinsky, "LFU-K: An Effective Buffer Management Replacement Algorithm", proceedings of DASFAA Conference, pp.670~681 (2004)
- B. Juurlink, "Approximating the Optimal Replacement Algorithm", proceedings of ACM CF Conference (2004)
- G. M. Sacco, "Index Access with a Finite Buffer", proceedings of VLDB (1987)
- C. H. Goh, "GHOST: Fine Granularity Buffering of Index", proceedings of VLDB (1999)
- A. Papadopoulos, "Global Page Replacement in Spatial Databases", proceedings of DEXA (1996)
- I. Kamel, "On Packing R-Trees", proceedings of CIKM, pp.490~499 (1993)
- T. Brinkhoff, "A Robust and Self-tuning Page Replacement Strategy for Spatial Database Systems", proceedings of EDBT, pp.533~552 (2002)
- L. Ki-Joune, "The Spatial Locality and a Spatial Indexing Method by Dynamic Clustering in Hypermap System", pp.207~223 (1990), Advances in Spatial Databases
- "UA Census 2000 TIGER/Line Files"[URL]