A scalable system for consistently caching dynamic web data

Abstract

This paper presents a new approach for consistently caching dynamic Web data in order to improve pegormanee. Our algorithm, which we call Data Update Propagation (DUP), maintains data dependence information between cached objects and the underlying data which affect their values in a graph. When the system becomes aware of a change to underlying data, graph traversal algorithms are applied to determine which cached objects are affected by the change. Cached objects which are found to be highly obsolete are then either invalidated or updated. DUP was a critical component at the ojjicial Web site for the 1998 Olympic Winter Games. By using DUE we were able to achieve cache hit rates close to 100% compared with 80% for an earlier version of our system which did not employ DUE As a result of the high cache hit rates, the Olympic Games Web site was able to serve data quickly even during peak request periods. © 1999 IEEE.