Dynamic Suppression of Similarity in the Web: a Case for Deployable Detection Mechanisms

Compression and delta-encoding [18] of web resources is a well-understood, but infrequently used, technology. Two existing proposals [8, 22] to extend delta-encoding beyond successive versions of the same resource suffer from a requirement that the parties participating in the delta-encoding process coordinate knowledge of their caches. We make a case for more general mechanisms, and propose a distributed approach that does not require advance coordination.

By: Frederick Douglis, Arun K. Iyengar, Kiem-Phong Vo

Published in: RC22514 in 2002

LIMITED DISTRIBUTION NOTICE:

This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.

RC22514.pdf

Questions about this service can be mailed to reports@us.ibm.com .