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

Cited 4 time in webofscience Cited 5 time in scopus
  • Hit : 424
  • Download : 0
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. (C) 2001 Published by Elsevier Science Inc.
Publisher
ELSEVIER SCIENCE INC
Issue Date
2001-10
Language
English
Article Type
Article
Keywords

MANAGEMENT

Citation

INFORMATION SCIENCES, v.138, no.1-4, pp.99 - 117

ISSN
0020-0255
DOI
10.1016/S0020-0255(01)00116-5
URI
http://hdl.handle.net/10203/82700
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 4 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0