Separable Hyperstructure and Delayed Link Binding

Brailsford, David F.

Abstract

As the amount of material on the World Wide Web continues to grow, users are discovering that the Web's embedded, hard-coded, links are difficult to maintain and update. Hyperlinks need a degree of abstraction in the way they are specified together with a sound underlying document structure and the property of separability from the documents they are linking. The case is made by studying the advantages of program/data separation in computer system architectures and also by re-examining some selected hypermedia systems that have already implemented separability. The prospects for introducing more abstract links into future versions of HTML and PDF, via emerging standards such as XPath, XPointer XLink and URN, are briefly discussed.

Citation

Brailsford, D. F. (1999). Separable Hyperstructure and Delayed Link Binding. ACM Computing Surveys, 31(4es), https://doi.org/10.1145/345966.346029

• Journal Article Type: Article
• Publication Date: Dec 1, 1999
• Deposit Date: Oct 10, 2005
• Publicly Available Date: Oct 9, 2007
• Journal: ACM Computing Surveys
• Print ISSN: 0360-0300
• Electronic ISSN: 1557-7341
• Publisher: Association for Computing Machinery (ACM)
• Peer Reviewed: Peer Reviewed
• Volume: 31
• Issue: 4es
• DOI: https://doi.org/10.1145/345966.346029
• Keywords: Hypertext, hyperlinking, linkbases, XLink, URN, XPath, XPointer
• Public URL: https://nottingham-repository.worktribe.com/output/1023826
• Additional Information: Final draft of survey paper accepted for ACM Computing Surveys