Incremental maintenance of semantic links in dynamically changing hypertext systems

Abstract

One purported advantage of hypertext systems is the ability to move between semantically related parts of a document (or family of documents). If the document is undergoing frequent modification (for example while an author is writing a book or while a software design stored in the hypertext system is evolving) the question arises as to how to incrementally maintain semantic interconnections in the face of the modifications. The paper presents an optimal technique for the incremental maintenance of such interconnections as a document evolves. The technique, based on theories of information retrieval based on lexical affinities and theories of incremental computation, updates semantic interconnections as nodes are checked into the hypertext system (either new or as a result of an edit). Because we use the semantic weight of lexical affinities to determine which affinities are meaningful in the global context of the document, introducing a new affinity or changing the weight of an existing affinity can potentially have an effect on any node in the system. The challenge met by our algorithm is to guarantee that despite this potentially arbitrary impact, we still update link information optimally. Once established the semantic interconnections are used to allow the user to move from node to node based not on rigid connections but instead on dynamically determined semantic interrelationships among the nodes. © 1990 Oxford University Press.