Node re-usability in structured hypertext systems

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.

REFERENCES

• BUSH45: Bush, V. As we may think. Atlantic Monthly. 176, 1 (July 1945). 101-108.
• CAN90: Fazli Can , Esen A. Ozkarahan, Concepts and effectiveness of the cover-coefficient-based clustering methodology for text databases, ACM Transactions on Database Systems (TODS), v.15 n.4, p.483-517, Dec. 1990 [doi>10.1145/99935.99938]
• CONK89: Jeff Conklin , Michael L. Begeman, gIBIS: a hypertext tool for exploratory policy discussion, ACM Transactions on Information Systems (TOIS), v.6 n.4, p.303-331, Oct. 1988 [doi>10.1145/58566.59297]
• DELI87: Norman M. Delisle , Mayer D. Schwartz, Contexts—a partitioning concept for hypertext, ACM Transactions on Information Systems (TOIS), v.5 n.2, p.168-186, April 1987 [doi>10.1145/27636.27639]
• ENGE68: Engelbart. D., English, W. A research center fiw augmenting human intellect. In Proceedings of the AFIPS Fall Jobff Compuler Conference. 33. (1968). 395-410.
• FRIS92: Frissc M., Cousins S. Mtxlels for hypcrtcxt. Journal of the American Society for hlfonnation Science. 43, 2 (Mar. 1992), 183-191.
• NELS67: Nelson, T. Getting it out of our system. In hlfonnalion Retrieval: A Critical Review: G. Schechter. Ed. Thompaon Books, Washington, D.C., 1967.
• NIEL90: Nielsen, J. Hypertexr told Hypennedia, Academic Press, San Diego, CA, 1990.
• STOT89: P. David Stotts , Richard Furuta, Petri-net-based hypertext: document structure with browsing semantics, ACM Transactions on Information Systems (TOIS), v.7 n.1, p.3-29, Jan. 1989 [doi>10.1145/64789.64791]
• WEST91: Westlad, J.C. Economic constraints in hypertext. Journal of the American Society for btfomlation Science. 42, 3 (April 1991). 178-184.
• YANK88: Nichole Yankelovich , Bernard J. Haan , Norman K. Meyrowitz , Steven M. Drucker, Intermedia: The Concept and the Construction of a Seamless Information Environment, Computer, v.21 n.1, p.81-83, 90-96, January 1988 [doi>10.1109/2.222120]
• YOSH91: Yoshinori Hara , Arthur M. Keller , Gio Wiederhold, Implementing hypertext database relationships through aggregations and exception, Proceedings of the third annual ACM conference on Hypertext, p.75-90, December 15-18, 1991, San Antonio, Texas, United States [doi>10.1145/122974.122982]

INDEX TERMS

Primary Classification:
  I. Computing Methodologies
  I.7 DOCUMENT AND TEXT PROCESSING
      I.7.2 Document Preparation
          Subjects: Hypertext/hypermedia

Additional Classification:
  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS
      G.2.2 Graph Theory
          Subjects: Network problems

  H. Information Systems
  H.5 INFORMATION INTERFACES AND PRESENTATION (I.7)
      H.5.2 User Interfaces (D.2.2, H.1.2, I.3.6)
          Subjects: Interaction styles (e.g., commands, menus, forms, direct manipulation)

General Terms:
Algorithms, Documentation, Languages