With the increasing popularity of the world wide web, it may be desirable to store copies of popular documents in proxy caches and thus diminish the delay times for URL requests. Web documents have to be treated as indivisible objects for the purpose of caching. In this paper we study the problem of caching web documents on disks. In web applications, the objects are of non-homogeneous size, and this leads to a problem in physical placement in any scheme which tries to emulate LRU. One solution is to use the FIFO scheme which simplifies the disk placement issue, because the order of physical placement can be completely dictated by the order of entry of an object into the cache. In this paper, we show how to achieve a generalization of the LRU policy for the case of caching web documents in such a way that the disk placement and fragmentation issue is handled efficiently.
By: Charu C. Aggarwal and Philip S. Yu
Published in: RC20636 in 1996
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .