Principles of database buffer management
ACM Transactions on Database Systems (TODS)
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
ACM Computing Surveys (CSUR)
Removal policies in network caches for World-Wide Web documents
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
An optimality proof of the LRU-K page replacement algorithm
Journal of the ACM (JACM)
Performance evaluation of Web proxy cache replacement policies
Performance Evaluation - Special issue on modelling techniques and tools for performance evaluation
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Operating Systems Theory
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
LRU-SP: A Size-Adjusted and Popularity-Aware LRU Replacement Algorithm for Web Caching
COMPSAC '00 24th International Computer Software and Applications Conference
Simulation Evaluation of a Heterogeneous Web Proxy Caching Hierarchy
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Flowchart techniques for structured programming
ACM SIGPLAN Notices
A survey of Web cache replacement strategies
ACM Computing Surveys (CSUR)
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
| Hi-index | 0.00 |
Today independent publishers are offering digital libraries with fulltext archives. In an attempt to provide a single user-interface to a large set of archives, the studied Article-Database-Service offers a consolidated interface to a geographically distributed set of archives. While this approach offers a tremendous functional advantage to a user, the fulltext download delays caused by the network and queuing in servers make the user-perceived interactive performance poor. This paper studies how effective caching of articles at the client level can be achieved as well as at intermediate points as manifested by gateways that implement the interfaces to the many fulltext archives. A central research question in this approach is: What is the nature of locality in the user access stream to such a digital library? Based on access logs that drive the simulations, it is shown that client-side caching can result in a 20% hit rate. Even at the gateway level temporal locality is observable, but published replacement algorithms are unable to exploit this temporal locality. Additionally, spatial locality can be exploited by considering loading into cache all articles in an issue, volume, or journal, if a single article is accessed. But our experiments showed that improvement introduced a lot of overhead. Finally, it is shown that the reason for this cache behavior is the long time distance between re-accesses, which makes caching quite unfeasible.