Rule-assisted prefetching in Web-server caching
Bin Lan, Stéphane Bressan, Beng Chin Ooi, Kian‐Lee Tan · 2000
Web servers manage large numbe rof documents of widely variable sizes.Moreover, the access patterns on the documents may also c hange over time.While some documents are highly popular over a prolonged period of time, we expe c tnewly added documents to increase in popularity while demand for most older documents decreases.It is therefore important to design eective caching strategy at the web server.In this paper, we present our approach to the problem.Our main contribution lies in the design of a novel prefetching strategy, called RAP.RAP identi es a set of association rules from the Web server's access log.Unlike existing mining strategy, RAP's miner values recently added log records more than earlier log records.Based on the rules, RAP predicts and prefetches documents from users initial requests.We conducted extensive study to evaluate RAP.The results show that RAP signi cantly outperforms existing schemes.We also show that the mining and caching cost is relatively low.