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
Dissertation

Caching Techniques For Dynamic Web Servers

Suresha
TL;DR: This thesis presents some novel ways of integrating existing solutions to address performance and scalability issues and aims at achieving reduced bandwidth consumption from web infrastructure perspective, and reduced page construction times from user perspective.
Posted Content

An Evaluation of Caching Policies for Memento TimeMaps

TL;DR: The goal of the caching algorithm is to exploit the ideally monotonically increasing nature of TimeMaps and not cache responses with fewer mementos than the already cached TimeMap, and a conditional cache replacement and a Time To Live (TTL) value to ensure the user has access to the most complete TimeMap available.
Proceedings ArticleDOI

Caching personalized and database-related dynamic Web pages

TL;DR: The experimental results show that Tomcat with proposed dynamic Web cache can increase the stability of web server and improves Web server throughput by up to 290%
Journal ArticleDOI

Web Cache Design and Implementation for Efficient SNMP Monitoring towards Internet-Scale Network Management

TL;DR: An SNMP-aware web cache design that gives the staleness of 0 and a bounded number of SNMP requests even when the number of users' requests goes to infinity is proposed.

Basis Token Consistency: A Practical Mechanism for Strong Web Cache Consistency

TL;DR: A new mechanism, which is called \Basis Token Consistency" or BTC, which allows any client (independent of the presence and conformity of any intermediaries) to maintain a self-consistent view of the server's state, and which could be integrated into a fragment-assembling Content Management System (CMS).
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.