scispace - formally typeset
Proceedings ArticleDOI

Class-based cache management for dynamic Web content

H. Zhu, +1 more
- Vol. 3, pp 1215-1224
Reads0
Chats0
TLDR
The experimental results show that the proposed techniques are effective in supporting coarse-grain cache management and reducing server response times for tested applications.
Abstract
Caching dynamic pages at a server site is beneficial in reducing server resource demands and it also helps dynamic page caching at proxy sites. Previous work has used fine-grain dependence graphs among individual dynamic pages and underlying data sets to enforce result consistency. This paper proposes a complementary solution for applications that require coarse-grain cache management. The key idea is to partition dynamic pages into classes based on URL patterns so that an application can specify page identification and data dependence, and invoke invalidation for a class of dynamic pages. To make this scheme time-efficient with small space requirement, lazy invalidation is used to minimize slow disk accesses when IDs of dynamic pages are stored in memory with a digest format. Selective precomputing is further proposed to refresh stale pages and smoothen load peaks. A data structure is developed for efficient URL class searching during lazy or eager invalidation. This paper also presents design and implementation of a caching system called Cachuma which integrates the above techniques, runs in tandem with standard Web servers, and allows Web sites to add dynamic page caching capability with minimal changes. The experimental results show that the proposed techniques are effective in supporting coarse-grain cache management and reducing server response times for tested applications.

read more

Citations
More filters
Journal ArticleDOI

Minimal cost replication of dynamic Web contents under flat update delivery

TL;DR: This work forms the minimum cost replication problem under a flat framework of update delivery, and proposes the optimal replication strategy which designates where each object should be replicated and how to keep the replicas up-to-date.
Book ChapterDOI

Accelerating dynamic web content delivery using keyword-based fragment detection

TL;DR: The results show that the keyword-based approach for fragment detection and extraction provides us with cacheable fragments that, when combined with the proposed mapping table augmentation, can provide significant advantages for fragment-based Web caching of existing dynamic Web content.
Journal ArticleDOI

Building a large and efficient hybrid peer-to-peer Internet caching system

TL;DR: The browsers-aware framework, a peer-to-peer Web caching management scheme, is extensively enhanced and deployed and it is shown that building such a caching system with considerations of sharing contents among clients, minimizing document duplications, and achieving data integrity and communication anonymity is not only feasible but also highly effective.
Patent

Methods and systems for opportunistic cookie caching

TL;DR: In this article, a trie data structure is proposed for caching cookies in a server. But the trie may be collapsed if they are equivalent and nodes of the tries are collapsed, and a server may retrieve cookies from the cache for use in a prefetch operation.
Journal ArticleDOI

Timeliness-Accuracy Balanced Collection of Dynamic Context Data

TL;DR: A middleware-based approach to enable a judicious composition of services for accuracy-aware scheduling and cost-aware database maintenance and a middleware framework for the real-time information collection process, where the information mediator coordinates and facilitates communication between information sources and consumers is proposed.
References
More filters

The Art in Computer Programming

Andrew Hunt, +1 more
TL;DR: Here the authors haven’t even started the project yet, and already they’re forced to answer many questions: what will this thing be named, what directory will it be in, what type of module is it, how should it be compiled, and so on.
Proceedings ArticleDOI

Web caching and Zipf-like distributions: evidence and implications

TL;DR: This paper investigates the page request distribution seen by Web proxy caches using traces from a variety of sources and considers a simple model where the Web accesses are independent and the reference probability of the documents follows a Zipf-like distribution, suggesting that the various observed properties of hit-ratios and temporal locality are indeed inherent to Web accesse observed by proxies.
Proceedings Article

The MD5 Message-Digest Algorithm

TL;DR: This document describes the MD5 message-digest algorithm, which takes as input a message of arbitrary length and produces as output a 128-bit "fingerprint" or "message digest" of the input.
Trending Questions (1)
How do I clear my Exchange server cache?

The experimental results show that the proposed techniques are effective in supporting coarse-grain cache management and reducing server response times for tested applications.