DocumentCode
334022
Title
A scalable system for consistently caching dynamic Web data
Author
Challenger, Jim ; Iyengar, Arun ; Dantzig, Paul
Author_Institution
IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
Volume
1
fYear
1999
fDate
21-25 Mar 1999
Firstpage
294
Abstract
This paper presents a new approach for consistently caching dynamic Web data in order to improve performance. 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. The DUP was a critical component at the official Web site for the 1998 Olympic Winter Games. By using DUP, 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 DUP. 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
Keywords
cache storage; entertainment; graph theory; information resources; search engines; sport; 1998 Olympic Winter Games; Web servers; Web site; cache hit rates; cached objects; data dependence information; data update propagation; dynamic Web data caching; graph traversal algorithms; scalable system; Central Processing Unit; Content management; Databases; File servers; Web pages; Web server;
fLanguage
English
Publisher
ieee
Conference_Titel
INFOCOM '99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE
Conference_Location
New York, NY
ISSN
0743-166X
Print_ISBN
0-7803-5417-6
Type
conf
DOI
10.1109/INFCOM.1999.749295
Filename
749295
Link To Document