Synchronizing a database to improve freshness
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Aging through cascaded caches: performance issues in the distribution of web content
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
The decay and failures of web references
Communications of the ACM
The Evolution of the Web and Implications for an Incremental Crawler
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Competitive freshness algorithms for wait-free data objects
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
| Hi-index | 0.00 |
Motivated by the work of cache freshness by Cho and Garcia-Molina [2], we present a new metric called additive age as an extension of existing freshness metrics. The additive age, being formulated somewhat differently, deviates from existing freshness metrics in its ability to better quantify the impact of frequently updated content on cache freshness. Mathematical result shows that the long-run average additive age is proportional to λT2, where λ is the change rate of source content, and T the refresh interval. This short paper briefly reviews the key elements of Cho and Garcia-Molina's work and simplifies their derivation by using renewal reward theory, with a focus on formulation of the notion of additive age.