Omer Abdalla
Fazli Can
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.
- BUSH45.Bush, V. As we may think. Atlantic Monthly. 176, 1 (July 1945). 101-108.Google Scholar
- CAN90.Can, E, Ozkarahan, E.A. Concepts and effectiveness of the cover-coefficient-based clustering methodology for text databases. ACM Transactions on Database Systents. 15, 4 (Dec. 1990), 483-517. Google ScholarDigital Library
- CONK89.Conklin. J., Begeman. M. gtBIS: A hypcrtcxt ttx~l for team design deliberation. ACM Transactions on Office blfomlation Systems. 6. 4 (Oct. 1988). 303-331. Google ScholarDigital Library
- DELI87.Dclisle, N. M., Schwartz. M.D. Contexts - A partitioning concept for hypcrtext. ACM Transactions on 01"~ce hiformation Systems. 5,2 (April 1987), 168--186. Google ScholarDigital Library
- 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.Google Scholar
- FRIS92.Frissc M., Cousins S. Mtxlels for hypcrtcxt. Journal of the American Society for hlfonnation Science. 43, 2 (Mar. 1992), 183-191.Google Scholar
- NELS67.Nelson, T. Getting it out of our system. In hlfonnalion Retrieval: A Critical Review: G. Schechter. Ed. Thompaon Books, Washington, D.C., 1967.Google Scholar
- NIEL90.Nielsen, J. Hypertexr told Hypennedia, Academic Press, San Diego, CA, 1990.Google Scholar
- STOT89.Stotts, E, Furuta, R. Petei-net-based hypertext: Document structure with browsing semantics. ACM Transactions on Office bObnuation Systems. 7,1 (Jan. 1989), 3-29. Google ScholarDigital Library
- WEST91.Westlad, J.C. Economic constraints in hypertext. Journal of the American Society for btfomlation Science. 42, 3 (April 1991). 178-184.Google Scholar
- YANK88.Yankelovich. N. Haan, B.J. Meyrowite, N.K., Drucker. S.M. Intermedia: the concept and construclion of a seamless information environment. Computer (Jan 1988), 81-96. Google ScholarDigital Library
- YOSH91.Yoshinen, H. Keller, A.M. Wiederhokl. G. Implementing hypertext database relationships through aggregation and .exceptions. In Proceedings o{ Hypertext '91. (December 1991), 75-90. Google ScholarDigital Library
Index Terms
- Node re-usability in structured hypertext systems
Recommendations
Feral hypertext: when hypertext literature escapes control
HYPERTEXT '05: Proceedings of the sixteenth ACM conference on Hypertext and hypermediaThis paper presents a historical view of hypertext looking at pre-web hypertext as a domesticated species bred in captivity, and arguing that on the web, some breeds of hypertext have gone feral. Feral hypertext is no longer tame and domesticated, but ...
A Structured Hypertext Data Model with Versioning for Engineering Documents
Hypertext involves linking related information blocks together to form a network. It is suitable to access information in a nonlinear fashion with a flexible structure. However, when the hypertext technique is applied to manage mass data such as ...
Hypertext and paper: A special synergy
Some people argue that hypertext is easy to write, is hard to create by converting existing text into hypertext, and has a massive market. This paper argues the contrary. First, hypertext is hard to write. Second, automatically converting a text into ...
Comments