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. PLEASE NOTE: a hypertext version of this paper is available at http://HTTP.CS.Berkeley.EDU/~wilensky/robust-hyperlinks.html
[1]
Thomas A. Phelps,et al.
Multivalent Documents: Anytime, Anywhere, Any Type, Every Way
,
1998
.
[2]
Sofus A. Macskassy,et al.
Maintaining Information Resources
,
1997,
NGITS.
[3]
Mark C. Little,et al.
Fixing the "Broken-Link" Problem: The W3Objects Approach
,
1996,
Comput. Networks.
[4]
Jitendra Malik,et al.
Blobworld: Image Segmentation Using Expectation-Maximization and Its Application to Image Querying
,
2002,
IEEE Trans. Pattern Anal. Mach. Intell..
[5]
Paul Francis,et al.
Ingrid: A Self-Configuring Information Navigation Infrastructure
,
1996,
World Wide Web J..
[6]
Robert Wilensky,et al.
Multivalent Documents: A New Model for Digital Documents
,
1998
.
[7]
Karen R. Sollins,et al.
Functional Requirements for Uniform Resource Names
,
1994,
RFC.