Browse Prior Art Database

Implementing Memory Efficient Hypertext in Online Manual Tool

IP.com Disclosure Number: IPCOM000120335D
Original Publication Date: 1991-Apr-01
Included in the Prior Art Database: 2005-Apr-02
Document File: 5 page(s) / 165K

Publishing Venue

IBM

Related People

Takehi, M: AUTHOR

Abstract

Disclosed is a memory efficient implementation of hypertext for an online manual tool. The implementation is derived largely due to the memory efficient design of data file management for hypertext function.

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 52% of the total text.

Implementing Memory Efficient Hypertext in Online Manual Tool

      Disclosed is a memory efficient implementation of
hypertext for an online manual tool.  The implementation is derived
largely due to the memory efficient design of data file management
for hypertext function.

      To cover the disadvantage of information being presented on a
two-dimensional display, an online manual tool should provide
functional elements of a manual such as: contents, index, glossary,
and footnote in a meaningful manner. One way of simulating these
functional elements effectively on a two-dimensional display is to
link terms and their associated data using hypertext method.  To
implement such hypertext function under a strict program memory
limitation, the following points are important:
   . No display contents are kept in program memory.  That is, the
information is displayed but not stored.
   . Even though the hypertext link information is complex, the link
information does not occupy a large amount of memory space.

      To manage the information display without buffering (not
keeping in program memory), the data retrieval from the data file is
controlled by using the appropriate file pointers in this
implementation.  To manage the complex hypertext link information
under a strict memory limitation, the memory management is handled as
a part of the data file and controlled by using the appropriate file
pointers.

      The following describes the method of managing the file
pointers for data to be displayed and for hypertext link information.

      Fig. 1 shows the conceptual view of the data file structure.
The first record (from the first-byte up to the end of the record)
contains the file pointer of the first byte of the index block.  The
program reads this pointer to start searching the target index record
in the index block.

      The display data from "1" to "N" contains each information unit
to be displayed.  The index block contains index records. The index
record contains the information for controlling each display data and
their hypertext links.

      Each display data may contain phrases that are indicated by
delimiter characters.  The phrases are highlighted when displayed and
allow the user to select for displaying the corresponding display
data.  (See Fig. 2.)

      The index block is structured as shown in Fig. 3.  The block
consists of index records.  Each index record corresponds to a
display data.  To display the appropriate data, the index block is
sequentially searched.  When the 4-byte search ID (display data ID)
matches the first 4-byte of an index record, only that index record
is stored in pro...