Date Added: Nov 2009
This paper presents a new approach for consistently caching dynamic Web data in order to improve performance. The algorithm, which the authors 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.