Data cache management using frequency-based replacement
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
The LRU-K page replacement algorithm for database disk buffering
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Semantic cache mechanism for heterogeneous Web querying
WWW '99 Proceedings of the eighth international conference on World Wide Web
Semantic caching via query matching for web sources
Proceedings of the eighth international conference on Information and knowledge management
2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Semantic Data Caching and Replacement
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
A Boolean Query Processing with a Result Cache in Mediator Systems
ADL '00 Proceedings of the IEEE Advances in Digital Libraries 2000
| Hi-index | 0.00 |
Caching issues in meta-search engines are considered. We propose a popularity-driven cache algorithm that utilizes both popularities and reference counters of queries to determine cache data to be purged. We show how to calculate query popularity. Empirical evaluations and performance comparisons of popularity-driven caching with the least recently used (LRU) and least frequently used (LFU) schemes have been carried out on collections of real data. In almost all cases, the proposed replacement policy outperforms LRU and LFU.