The LRU-K page replacement algorithm for database disk buffering
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Removal policies in network caches for World-Wide Web documents
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Proxy caching that estimates page load delays
Selected papers from the sixth international conference on World Wide Web
Semantic cache mechanism for heterogeneous Web querying
WWW '99 Proceedings of the eighth international conference on World Wide Web
Replacement policies for a proxy cache
IEEE/ACM Transactions on Networking (TON)
Operating System Concepts, 4th Ed.
Operating System Concepts, 4th Ed.
Proxy Cache Replacement Algorithms: A History-Based Approach
World Wide Web
Cache Invalidation and Replacement Strategies for Location-Dependent Data in Mobile Environments
IEEE Transactions on Computers
IEEE Transactions on Knowledge and Data Engineering
Semantic Caching and Query Processing
IEEE Transactions on Knowledge and Data Engineering
Semantic Data Caching and Replacement
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Replacement Policies for a Distributed Object Caching Service
On the Move to Meaningful Internet Systems, 2002 - DOA/CoopIS/ODBASE 2002 Confederated International Conferences DOA, CoopIS and ODBASE 2002
A predicate-based caching scheme for client-server database architectures
The VLDB Journal — The International Journal on Very Large Data Bases
Cost-aware WWW proxy caching algorithms
USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
Monte Carlo Strategies in Scientific Computing
Monte Carlo Strategies in Scientific Computing
| Hi-index | 0.00 |
This article presents the Web cache replacement algorithm named Least Semantically Related (LSR), as an alternative to well-known and widely employed replacement policies, such as SIZE, LFU and LRU, which are based on physical properties of objects (documents). LSR is based on the semantics of the information contained within objects: LSR tends to evict objects which are less related to the last object to enter the cache with respect to their semantics, therefore preserving objects of more interest to clients. A detailed algorithm and a data structure for LSR where objects are classified according to a previously established taxonomy were designed and implemented for the purposes of validation and comparison with other replacement policies. Besides, a framework for simulation was designed and verified, including the data preparation process. The initial experimental results show that LSR out-performs traditional policies in terms of hit rate, in most cases.