Contexts—a partitioning concept for hypertext
ACM Transactions on Information Systems (TOIS)
gIBIS: a hypertext tool for exploratory policy discussion
ACM Transactions on Information Systems (TOIS)
Petri-net-based hypertext: document structure with browsing semantics
ACM Transactions on Information Systems (TOIS)
Concepts and effectiveness of the cover-coefficient-based clustering methodology for text databases
ACM Transactions on Database Systems (TODS)
Implementing hypertext database relationships through aggregations and exception
HYPERTEXT '91 Proceedings of the third annual ACM conference on Hypertext
Hi-index | 0.00 |
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.