Logo image
Back
Cost-based replacement algorithm for object buffers
Journal article   Open access

Cost-based replacement algorithm for object buffers

Chong-Mok Park, Kyu-Young Whang, Jeong-Joon Lee, Il-Yeol Song and IEEE COMPUTER SOCIETY
Proceedings - International Computer Software & Applications Conference, v 24, pp 589-597
01 Jan 2000
DOI: https://doi.org/10.1109/CMPSAC.2000.884785
Featured in Collection :   UN Sustainable Development Goals @ Drexel
url
https://doi.org/10.1212/wnl.0b013e3181b2a4f5View
Published, Version of Record (VoR)Open Access (License Unspecified),  Open

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

13 Record Views

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:

Web of Science research areas
Computer Science, Software Engineering
Engineering, Electrical & Electronic
Logo image