Logo image
Back
A cost-based buffer replacement algorithm for object-oriented database systems
Journal article   Peer reviewed

A cost-based buffer replacement algorithm for object-oriented database systems

Chong-Mok Park, Kyu-Young Whang, Jeong-Joon Lee, Il-Yeol Song and Johnny Jiung-Yee Lee
Information sciences, v 138(1), pp 99-117
2001
DOI: https://doi.org/10.1016/S0020-0255(01)00116-5
Featured in Collection :   UN Sustainable Development Goals @ Drexel

Abstract

Many object-oriented database systems manage object buffers to provide fast access to objects. Traditional buffer replacement algorithms based on fixed-length pages simply assume that the cost incurred by operating a buffer is proportional to the number of buffer faults. However, this assumption no longer holds in an object buffer where objects are of variable-lengths and the cost of replacing an object varies for each object. In this paper, we propose a cost-based replacement algorithm for object buffers. The proposed algorithm replaces the objects that have minimum costs per unit time and unit space. The cost model extends the previous page-based one to include the replacement costs and the sizes of objects. The performance tests show that the proposed algorithm is almost always superior to the LRU-2 algorithm and, when significant replacement cost is involved, is more than twice as fast.

Metrics

7 Record Views
4 citations in Web of Science
5 citations in Scopus

Details

UN Sustainable Development Goals (SDGs)

This publication has contributed to the advancement of the following goals:

#11 Sustainable Cities and Communities

InCites Highlights

Data related to this publication, from InCites Benchmarking & Analytics tool:

Collaboration types
Domestic collaboration
International collaboration
Web of Science research areas
Computer Science, Information Systems
Logo image