Node re-usability in structured hypertext systems

  • Authors:
  • Omer Abdalla;Fazli Can

  • Affiliations:
  • Department of Systems Analysis, Miami University, Oxford, OH;Department of Systems Analysis, Miami University, Oxford, OH

  • Venue:
  • CSC '93 Proceedings of the 1993 ACM conference on Computer science
  • Year:
  • 1993

Quantified Score

Hi-index 0.00

Visualization

Abstract

When the size of a graph-based hyperdocument exceeds a certain limit, the graph structure gets complicated and causes navigation and document management problems. A simple solution for this problem is the structuring of the hyperdocument into several smaller units. In this approach each unit contains nodes that share common properties and their link structures. Smaller, more manageable networks (called webs) which have their own, less complex graph structures are the result. In this paper we propose a model for hypertext systems which allows hyperdocument structuring using webs. The model demonstrates node reusability which becomes essential as it is very likely that the smaller units created will share nodes. The implementation details of a hypertext authoring system, HypAS, based on the proposed model are also provided.