BEAST: a buffer replacement algorithm using spatial and temporal locality

Authors:
Jun-Ki Min
Affiliations:
School of Internet-Media Engineering, Korea University of Technology and Education, Chungnam, Republic of Korea
Venue:
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part II
Year:
2006

Citing 16
Cited 1

Principles of database buffer management

ACM Transactions on Database Systems (TODS)
The R*-tree: an efficient and robust access method for points and rectangles

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
The LRU-K page replacement algorithm for database disk buffering

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
On packing R-trees

CIKM '93 Proceedings of the second international conference on Information and knowledge management
BROOM: buffer replacement using online optimization by mining

Proceedings of the seventh international conference on Information and knowledge management
Processing and optimization of multiway spatial joins using R-trees

PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
LRFU: A Spectrum of Policies that Subsumes the Least Recently Used and Least Frequently Used Policies

IEEE Transactions on Computers
A Robust and Self-tuning Page-Replacement Strategy for Spatial Database Systems

EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
GHOST: Fine Granularity Buffering of Indexes

VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Index Access with a Finite Buffer

VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
The Spatial Locality and a Spatial Indexing Method by Dynamic Clustering in Hypermap System

SSD '91 Proceedings of the Second International Symposium on Advances in Spatial Databases
Global Page Replacement in Spatial Databases

DEXA '96 Proceedings of the 7th International Conference on Database and Expert Systems Applications
Approximating the optimal replacement algorithm

Proceedings of the 1st conference on Computing frontiers
Multi-way spatial join selectivity for the ring join graph

Information and Software Technology
ARC: a self-tuning, low overhead replacement cache

FAST'03 Proceedings of the 2nd USENIX conference on File and storage technologies

DICE: an effective query result cache for distributed storage systems

Journal of Computer Science and Technology

Quantified Score

Hi-index	0.00

Visualization

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.