Robust Hyperlinks Cost Just Five Words Each

Thomas A. Phelps and Robert Wilensky

EECS Department
University of California, Berkeley
Technical Report No. UCB/CSD-00-1091
2000

http://www2.eecs.berkeley.edu/Pubs/TechRpts/2000/CSD-00-1091.pdf

We propose robust hyperlinks as a solution to the problem of broken hyperlinks. A robust hyperlink is a URL augmented with a small "signature", computed from the referenced document. The signature can be submitted as a query to web search engines to locate the document. It turns out that very small signatures are sufficient to readily locate individual documents out of the many millions on the web.

Robust hyperlinks exhibit a number of desirable qualities: They can be computed and exploited automatically, are small and cheap to compute (so that it is practical to make all hyperlinks robust), do not require new server or infrastructure support, can be rolled out reasonably well in the existing URL syntax, can be used to automatically retrofit existing links to make them robust, and are easy to understand. In particular, one can start using robust hyperlinks now, as servers and web pages are mostly compatible as is, while clients can increase their support in the future.

Robust hyperlinks are one example of using the web to bootstrap new features onto itself.


BibTeX citation:

@techreport{Phelps:CSD-00-1091,
    Author = {Phelps, Thomas A. and Wilensky, Robert},
    Title = {Robust Hyperlinks Cost Just Five Words Each},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {2000},
    URL = {http://www2.eecs.berkeley.edu/Pubs/TechRpts/2000/5442.html},
    Number = {UCB/CSD-00-1091},
    Abstract = {We propose robust hyperlinks as a solution to the problem of broken hyperlinks. A robust hyperlink is a URL augmented with a small "signature", computed from the referenced document. The signature can be submitted as a query to web search engines to locate the document. It turns out that very small signatures are sufficient to readily locate individual documents out of the many millions on the web. <p>Robust hyperlinks exhibit a number of desirable qualities: They can be computed and exploited automatically, are small and cheap to compute (so that it is practical to make all hyperlinks robust), do not require new server or infrastructure support, can be rolled out reasonably well in the existing URL syntax, can be used to automatically retrofit existing links to make them robust, and are easy to understand. In particular, one can start using robust hyperlinks now, as servers and web pages are mostly compatible as is, while clients can increase their support in the future. <p>Robust hyperlinks are one example of using the web to bootstrap new features onto itself.}
}

EndNote citation:

%0 Report
%A Phelps, Thomas A.
%A Wilensky, Robert
%T Robust Hyperlinks Cost Just Five Words Each
%I EECS Department, University of California, Berkeley
%D 2000
%@ UCB/CSD-00-1091
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/2000/5442.html
%F Phelps:CSD-00-1091