This work describes an improved LRU algorithm, called LRU-H, which uses a heuristic function for an optimum determination of the object to be removed from cache. Comparing to the use of LRU algorithm, algorithm LRU-H enables to obtain a significant decrease of the time needed to extract data from a database when using an object cache extraction and provides a hit ratio about 14.37% higher than LRU algorithm, 10.84% higher than LRFU algorithm and 7.37% higher than ARC algorithm.
cache, LRU-H algorithm, optimization, heuristic function, hash function, hit ratio
All articles published by Studies in Informatics and Control (SIC) are published in accordance with the terms and conditions of the Creative Commons Attribution License (CC BY-NC-SA 4.0).