JP2906949B2 - Hypertext device - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

The present invention relates to relates to a hypertext apparatus links can set a plurality of inter-node, in particular, more configured hypertext link information that holds the relationship between the node and the node that holds the information And a hypertext device for displaying information of each node according to link information.

[0002]

2. Description of the Related Art Initially, a hypertext device holds information in units called nodes, displays character information held in the nodes, and freely links between a plurality of nodes. It has been developed as a system that can structure each unit of information and access reference information.

In recent years, a hypertext system has appeared which includes not only characters but also so-called multimedia information such as monochromatic images, color images, voices, and moving images as information held in nodes (hereinafter abbreviated as node information). ,
Applications in various fields have been proposed.

[0004] Regarding a conventional general hypertext device, see the document "Hypertext: An Introduction an.
d Survey ", Computer, September 1987, IEEE".

[0005] In such a hypertext device, the concept of a link is provided as a means for defining a relationship between nodes which are units for holding information.
Link information that defines a relationship between nodes in the hypertext device is, for example, a node A and a node B.
A pair is defined between the two nodes for bidirectional reference. In each node, a plurality of link information of the control information is defined together with the node information of the content of the node, and the information is held in a primary storage or a secondary storage device as information constituting a main body of the hyper test. .

[0006] Further, the nodes of the information constituting the main body of the hyper test can form a tree structure or a network structure by a plurality of nodes by such a configuration of the link information. Can be displayed as For example, FIG. 1 and FIG. 2 are diagrams for explaining the concept of nodes and links in a general hypertext device. FIG. 1 shows an overall conceptual diagram of a data structure composed of nodes and links. Shows an example of the link information held in the node.

In FIG. 1, 11, 12, 13, and 14 indicate respective nodes, and 15, 16, and 17 indicate links. As shown in FIG. 1, the data structure of the node group of the hypertext exemplified here has four nodes (NODE-A, NODE-B, NODE-C, NOD-C).
For a node group composed of E-D), a link (LINK) is formed in a tree structure as a link relationship between the nodes.
# 1, LINK # 2, LINK # 3) are set.

[0008] Here, the link information is held in each node. For example, as shown in FIG.
The link information is set as the information of the data structure in the list format in the node 11 of “−A”. That is,
Between the “START” label 20 and the “END” label 24, the first link information 21 of “LINK # 1” and the “LI
The second link information 22 of “NK # 2” and “LINK #”
The three pieces of link information of the third link information 23 of "3" are set as information defining a link relationship between the node 11 of "NODE-A" and another node.

That is, as shown in FIG.
The node 11 of “A” is the node 12 of “NODE-B”.
"NODE-C" node 13 and "NODE-C"
Three links (LINK # 1, LINK # 2, LINK # 3) to three nodes with the node 14 of "D" 1
5 , 16, and 17 are defined and associated with each other. As shown in FIG. 2, the link information in “NODE-A” includes first link information 21 of “LINK # 1”, second link information 22 of “LINK # 2”, and second link information 22 of “LINK # 3”. Each piece of link information of the three link information 23 is linked by a pointer of a data structure in a list format and held in a primary storage or a secondary storage device.

In this case, the node 11 of "NODE-A"
In order to access another node group linked to this node, the link information group held in the node 11 of “NODE-A” is changed from the “START” label 20 to “E”.
ND "label 24, and each link information (21 to 21) held in the data structure of the list format.
This is performed by referring to the node specified by 23). In other words, the order of reference to the nodes here is
The link information is determined by the order (link order) of link information linked by a pointer in a list format from the “START” label 20 to the “END” label 24.

In this example, the first link information 21 of "LINK # 1", the second link information 22 of "LINK # 2",
And the node 11 of “NODE-A” in the reading order of the link information of the third link information 23 of “LINK # 3”.
To the node 12 of the next “NODE-B”, to the node 13 of the next “NODE-C”, and further to the next “NODE-B”.
Each node is accessed in the order of “−D” node 14. In the case of reverse access from the node 12 of “NODE-B”, although not shown, “NODE-B”
The node 12 of “−B” holds link information to the node 11 of “NODE-A” as link information for bidirectional reference.
On the contrary, the node 12 of “-B” can access the node 11 of “NODE-A”.

[0012]

In a hypertext apparatus having such a data structure, when link information is added to an existing node group together with a new node, the link information is simply added to the existing node group. It is simply added to the list at the end of the link information. This will be described below.

FIGS. 3 and 4 show the "NODE" shown in FIG.
FIG. 13 is a diagram illustrating a state in which a node “NODE-E” is newly added to a node “−A” and linked; FIG.
FIG. 4 shows an entire data structure of a node group in a state where a new node is added, and FIG. 4 shows link information held in a node “NODE-A” in a state where link information is newly added. Is shown. In this case, as shown in FIG. 3, the data structure of the node group of FIG.
ODE-E "node 32 and its link 33
Is added, the link information of the node of "NODE-A" is updated, and the node of "NODE-A" becomes the node 31, and as shown in FIG.
The new link information 41 is added to the end of the third link information 23, which is the original end link information, in the link information held in the node 31.

As described above, when a new link is set to a certain node in the hypertext device, a new link is added to the end of the link information group relating to the node group already stored in the primary storage or the secondary storage device. Only a link is added. For this reason, in the conventional hypertext device, the following problems remain regarding the operation and reading of the link information.

First, there is a problem that the link information readout result is fixed in the link generation order, and the link information readout order is not arbitrarily changed. For example, one node “NOD” set in a state as shown in FIG.
A link (LINK # to the new node “NODE-E” to be added to the link information about “EA”
When the addition operation of 4) is performed, as shown in FIG. 4, new link information is simply connected to the end of the link information group by a pointer. As a result, even if the link information relating to the node “NODE-A” held on the primary storage or the secondary storage device is read by a link information reading operation function provided by NoteCards, for example, In that case, “LINK # 1 LINK # 2
LINK # 3, such as LINK # 3
Only a list with 4 added to the end is obtained. For this reason, after setting a new node, it is not possible to newly set link information by specifying an order so that the result read by the link information reading operation function is obtained as the Nth element.

Therefore, in the hypertext device, for example, the contents of the node information of the nodes linked sequentially from the specific node in a certain fixed time are temporarily stored or stored.
When creating an application program to be read from the next storage and displayed on the screen, link information must be set in advance in consideration of the display order.

The second problem is that there is no means for operating the order of link information that defines the relationship between nodes. For example, NoteCards provides a library of operation functions for nodes and links, since links are not originally ordered, so that certain nodes are linked to nodes linked from a specific node, or the order is arbitrarily changed. Operation means to perform the operation is not provided. For this reason,
There is a problem that it is not possible to write and execute an operation script for displaying a group of nodes linked from a specific node in an arbitrary order specified by a user.

Therefore, in the hypertext device, for example, the contents of the nodes linked from the specific node are read out from the primary storage or the secondary storage in a certain fixed time and displayed on the screen, as in the case described above. In the application program, the order of the link set in advance is
The order cannot be changed to an arbitrary order according to a user's instruction or a program's instruction.

The present invention has been made to solve these problems, and an object of the present invention is to provide a hypertext device in which a plurality of links between nodes can be set. On the other hand, an object of the present invention is to provide a hypertext device which can give an arbitrary order and can operate the given order.

Another object of the present invention is to manage a hypertext composed of a node holding information and link information holding a relationship between the nodes in a hypertext device in which a plurality of links between nodes can be set. It is another object of the present invention to provide a hypertext device for displaying information of each node according to link information given an arbitrary order.

[0021]

Means for Solving the Problems] To achieve the above object, a hypertext apparatus of the present invention, as a first aspect, more configuration link information holds the relationship between the node and the node that holds the information In a hypertext device for managing hypertexts to be displayed and displaying information of each node according to link information, node information storage means for managing nodes and storing information held in the nodes, and holding relationships between the nodes. Link information management means for assigning and managing an order to link information, link order operating means for operating the order of the link information, and display control means for sequentially displaying nodes according to the order of the link information It is characterized by.

Further, the hypertext apparatus of the present invention
As a second feature, the link information management means stores each link information according to a data structure that can be ranked,
The link order operation means performs reference, addition, deletion, and replacement operations on each element of the data structure.

As a third feature, the hypertext apparatus according to the present invention further comprises a link information browse for displaying a list of all or specified link information managed by the link information management means on a display screen. Means are provided.

As a fourth feature, the hypertext device of the present invention further comprises user interface means for directly operating the order of the link information listed on the display screen by the link information browsing means. It is characterized by.

[0025]

In hypertext apparatus of the effects of the present invention to manage the more configured hypertext link information that holds the relationship between the node and the node that holds the information and displays the information for each node according to the link information. This place
In this case, the node information storage means manages the nodes and stores information held in the nodes, and the link information management means manages the link information holding the relationships between the nodes by assigning an order to the link information. For this reason, when the link order operating means operates the order of the link information by, for example, addition, deletion, replacement, or the like, the display control means sequentially displays the nodes in accordance with the order of the link information.

Thus, in the hypertext in which a plurality of links between the nodes are set, a plurality of links set in the nodes can be arbitrarily assigned, and the given order can be operated. Also, more configured hypertext link information that holds the relationship between the node and the node that holds the information, any hierarchy is given to the link information, according to ranking by link information, information of each node Displayed sequentially.

When the link information management means assigns a rank to the link information and manages the link information, each link information is stored in accordance with a data structure that can be ranked. On the other hand, the link sequence operation means performs a reference, addition, deletion, and replacement operation on each element of the data structure to operate the link sequence. Therefore, the order of the link information can be arbitrarily and easily operated.

In connection with the operation of link order, link information browsing means is further provided here. The link information browsing means displays a list of all or specified part of the link information managed by the link information management means on a display screen. Then, when the link information is displayed in a list on the display screen, the user interface means directly operates the order of the link information listed on the display screen by the link information browsing means. As a result, the operation of the order of the link information indicating the relationship between the nodes is
It can be easily operated by the operation on the display screen.

As described above, the link information indicating the relationship between the nodes is assigned and managed in an arbitrary order. For example, according to the order of the links, reference, addition, deletion, replacement, etc. of the N-th link information is performed. The operation can be easily performed. Further, an operation on an arbitrary node linked to the node can be easily performed by a user instruction or a program instruction. For this reason, for example, it is possible to easily construct an application program or the like that switches the display of the nodes at regular intervals in a specific order.

[0030]

DESCRIPTION OF THE PREFERRED EMBODIMENTS Embodiments of the present invention will be specifically described below with reference to the drawings. FIG. 5 is a block diagram showing a configuration of a main part of the hypertext device according to one embodiment of the present invention. In FIG. 5, 1 is an interface control unit, 2 is an input control unit, 3 is a program execution unit, 4 is a display control unit,
Denotes a node information management unit, 6 denotes a link information management unit, 7 denotes a link sequence operation unit, and 8 denotes a link information entity management unit.

The hypertext device shown in the block diagram of FIG. 5 manages nodes in the original processing element of the hypertext device that holds node information of the hypertext, and assigns an order to link information between the nodes. It has a configuration in which processing elements for managing and operating are added. The interface control unit 1 controls a user interface relating to operation of nodes and links of the hypertext, and notifies the program execution unit 3 of the occurrence of an event detected by the input control unit 2. Further, the interface control unit 1 causes the information entity of the node to be displayed in a rectangular area (window) on the display via the display control unit 4.

The input control unit 2 detects a user operation event obtained from an input device such as a keyboard or a mouse, and notifies the interface control unit 1 of the event. The program execution unit 3 instructs the node information management unit 5, the link information management unit 6, and the link sequence operation unit 7 to generate a node, generate a link, and change the link sequence according to the instructions from the interface control unit 1. I do. The display control unit 4
In accordance with an instruction from the interface control unit 1, information is displayed on a designated screen area.

The node information management unit 5 manages a plurality of node information structures holding information on each node, and the link information management unit 6 manages a plurality of link information structures holding relationships between the nodes. I manage my body. Further, the link order operation unit 7 changes the order of the plurality of link information structures 9 referred to by the node information management unit 5 according to an instruction from the program execution unit 3. Node information entity management unit 8
Manages node information referred to as entity information from each node, for example, information such as a character string, an image, a moving image, and a sound held in a primary storage or a secondary storage.

FIG. 6 is a diagram for explaining members of the node information structure held in the node information management unit. As shown in FIG. 6, the members constituting the node information structure 9 held in the node information management unit (5: FIG. 5) include a node identifier slot 61, a display procedure slot 62, an entity information pointer slot 63, and a link. It consists of information stored in the information slot 64. Node identifier slot 6
Numeral 1 is for uniquely identifying the node information structure in the system. The display procedure slot 62 holds a pointer to a procedure program function for displaying the node on the screen. Entity information pointer slot 63
Holds a pointer to the information to be displayed by the node. As this information, for example, a character string, image information, a moving image, audio, or the like can be used as entity information. The link information slot 64 holds a pointer to a link information structure holding link information given to the node as a data structure in a list format.

FIG. 7 is a diagram for explaining slots of the link information structure managed by the link information management unit. FIG.
As shown in FIG. 5, the slots constituting the link information structure 10 managed by the link information management unit (6: FIG. 5) include a link identifier slot 71, a From link slot 7
2, and a To link slot 73. The link identifier slot 71 is for uniquely identifying the present link information structure in the system, and the From link slot 72 is, for example, when a link is set from NODE-A to NODE-B. "NODE-
A holds a pointer to the node information structure of "A". To
The link slot has the link NO
When DE-A is set to NODE-B, "N
Holds a pointer to the "ODE-B" node information structure.

Next, an operation example of the hypertext device according to the present embodiment will be described by exemplifying a case of operating the order of links between nodes. FIG. 8 is a diagram illustrating an example of a screen display of a user interface in an application program of the hypertext device. As shown in FIG. 8, the screen display of the user interface is “NOD” by the processing of the interface control unit and the display control unit (FIG. 5).
A window 80 displaying the node “EA” is opened. This window 80 includes a node content display area 81,
It is composed of three areas: an operation instruction area 82 and an order display area 83.

The user interface is constituted by three areas in such a window. In this window 80, a node content display area 81
Is an area for displaying entity information of a group of nodes linked from the node in an order. In the operation instruction area 82, a display instruction “PLAY” according to the order of the nodes, a node insertion instruction “INS”,
A button 84 for giving an instruction such as an instruction for deletion “DEL” is displayed, and these instructions are given by a user interface function. In the order display area 83, icons 85 indicating the respective nodes linked from the node are displayed according to the order of the link information, starting from the left, starting from the left.
With this icon display, the order of the nodes is displayed in a list together with the link relationships in the node.

In the "NODE-A" node window shown in FIG. 8, the "NODE-A"
-B "icon," NODE-C "icon,
The icon of “NODE-D” is displayed, and the node of “NODE-A” is linked to the node of “NODE-B”, the node of “NODE-C”, and the “NODE-D” by the link information. D "indicates that the nodes are linked in this order. Therefore, by changing the left-justified order of the icons 85 displayed in the order display area 83, the order of each piece of link information set in the node “NODE-A” can be changed.

For example, with respect to the icons 85 displayed in the order display area 83 of the window interface, the left-justified order is such that the icon of “NODE-C” is followed by the icon of “NODE-B”. If the operation of reversing the order is performed by a mouse operation (by a graphical user interface function), the order of the link information in the “NODE-A” node can be changed by this operation.

FIG. 9 is a diagram conceptually showing the relationship between nodes and links in a state where the order of link information has been changed. A node “NODE-C”, a node “NODE-B” and a node “NODE-D” are added to the node “NODE-A”.
Of three nodes are respectively “LINK #
2 shows a state where the link information is linked by the link information “LINK # 1” and the link information “LINK # 3”. However, in this case, the order of the link information is “LINK # 2”,
"LINK # 1" link information and "LINK # 1"
The order of the link information is “3”.

Therefore, here, for example, “NOD
When the user clicks a “PLAY” button for giving a display processing instruction in the operation instruction area 82 according to the order of the nodes from the window 80 of the node “EA”,
Display processing of the linked nodes is sequentially performed according to the link information. In the node content display area 81 of the window 80, after the content of the node of “NODE-A” is displayed, “NODE-C” is displayed next. The contents of the node are displayed, and then the contents of the node "NODE-B" are displayed. And then, "NODE-
The contents of nodes "D" are sequentially displayed.

Next, a description will be given of a data structure in which the state of such nodes and links is set. FIG. 10 is a diagram schematically illustrating a data structure in which hypertext data in a node and link state as illustrated in FIG. 9 is stored in the node information management unit and the link information management unit. As described above, the node “NODE-A”
C "node," NODE-B "node, and" N
Links are provided in this order to three nodes of “ODE-D”. Therefore, the link information of the node information structure of “NODE-A” in this state is:
(LINK # 2 LINK # 1 LINK # 3) is held as list information, and a link state and an order of the link are set. Similarly, as the link information of the node information structures of the other nodes, link information indicating the link state of the reverse reference is held as list information.

FIG. 11 is a flowchart for explaining the processing operation when displaying contents according to the link order. In this case, the process is started by clicking the "PLAY" button with the mouse in the operation instruction area 82 of the window 80 shown in FIG. 8, and the contents are displayed according to the order set in the link information. .

First, in step 101, the input control unit 2 detects that the user has operated the "PLAY" button in the operation instruction area (mouse event), and notifies the interface control unit 1. Next, in step 102, the “NOD” of the processing target displayed in the operation target window is displayed from the position of the operated mouse on the display screen.
The node of “EA” is determined, the node information structure of “NODE-A” is obtained from the node information management unit 5, and is set as the processing target NODE.

Next, in step 103, the link information of the node information structure is obtained from the NODE to be processed (the node of "NODE-A"), and the variable "LINKLIST" is obtained.
To set the link information. In the next step 104, the value of the loop counter is set. That is, the count variable “N” is set to the initial value “1”, and the end value variable “MAX” is set to the number of elements of the preceding variable “LINKLIST”.

Then, the process proceeds to step 105, and the sequential display processing of each node information from step 105 is started. First, in step 105, the link sequence operation unit 7 searches the link information set in the LINKLIST for the N-th link information structure, and retrieves the variable “LIN”.
KN ”. For example, if the link information is realized by a list-type data structure,
It is realized by a function such as a function NTH of the LISP processing system.

In the next step 106, the previous step 1
The pointer to the next node information structure pointed to by the pointer stored in the slot of the To link is referred to by referring to the variable “NODE -N ". As a result, information to the Nth node to be displayed next can be obtained. Next, in step 107, the entity information associated with the entity information pointer of the node information structure pointed to from the obtained pointer information to the node is accessed and read, and the entity held in the node information entity management unit 8 is read. Information (character strings, images, sounds, moving images, etc.) is obtained, and the contents are displayed and reproduced in the node contents display area of the window.

Next, at step 108, the variable N of the loop counter is updated. That is, “1” is added to the count variable “N”. Then, the next step 109
, The value of the count variable “N” of the loop counter is compared with the value of the end value variable “MAX”, and if the value of N is equal to or larger than the value of MAX (N ≧ MAX), this processing ends. If the comparison here is not N ≧ MAX, the process returns to step 105, and the reproduction process of the next node information is executed in relation to the next link information. Such processing is executed, the node “NODE-C” is displayed according to the order of the link information, the node “NODE-B” is displayed, and then the node “NODE-D” is displayed. Three nodes are displayed in order.

Next, based on the state of the nodes and links shown in FIG. 9, the node "NODE-E" is newly added to "NODE-E".
The operation in the case of inserting immediately after the node “−C” will be described. FIG. 12 is a flowchart illustrating a processing operation when a node insertion operation is performed. In this case, the processing is performed in the operation instruction area 8 of the window 80 shown in FIG.
In step 2, the process is started by clicking the "INS" button with the mouse.

First, in step 201, when the operation of the “INS” button in the operation instruction area 82 (mouse event) is detected by the interface control unit 1 via the input control unit 2, In order to display that the processing of the insertion operation has been started, for example, the display control unit 4 displays an insertable node candidate menu. Then, next, in step 202, the node information structure (insertion node candidate) related to the node selected in the node candidate menu is changed by the variable “I
NS-NODE ". Here, "NODE-
It is assumed that the node "E" is selected as the insertion node.

In the next step 203, when the insertion position of the node "NODE-E" to be inserted is designated by the user, "NO" substituted in the variable "INS-NODE"
The number of the node where the insertion position of “DE-E” is to be detected is detected, and the value is set to a variable “N”. Next, in step 204, the current processing target NODE (“NODE-NODE-NODE”) displayed in the node content display area of the window is displayed.
A)), the link information of the node information structure is read, and is set to a variable “LINKLIST”.

Further, in the next step 205, the link information management unit 6 sets a new link between the node of the processing target NODE (“NODE-A”) and the insertion node candidate (“NODE-E”). Requesting generation of a new link information structure, and storing the generated link information structure in a variable “LINKSTR”.

Next, at step 206, the variable "L
INKSTR ”in the link information structure
In the slot of m link, “NO” which is the processing target NODE
DE-A ", and store a pointer to the node information structure.
Further, the variable “INS-NO” is stored in the slot of the To link.
“NODE-” of the insertion node candidate held in “DE”
The pointer to the node information structure of "E" is stored.

Next, in step 207, the link sequence operating unit 7 inserts the link information structure held in the variable "LINKSTR" into the N-th link information structure list in the link information of the variable "LINKLIST". . Then, in the next step 208, “NO
The slot of the link information of the node information structure of “DE-A” is set to “LINKLIS” including the new link information structure.
T ", and the process ends here.

According to the above operation, the new node (NODE-E) becomes “NOD-E” in the order specified by the user.
The state is linked to the node "EA". In this state, for example, the operation of the processing of “PLAY” as in the flowchart shown in FIG. 11 described above is changed to “NODE-A”.
, The inserted “NODE-E” node is displayed Nth.

[0056]

As described above, according to the hypertext apparatus of the present invention, it is possible to provide a user interface for assigning and managing a link between hypertext nodes and operating the link. For this reason, for example, in a hypertext device, it is possible to easily construct an application program or the like that switches the display of nodes at regular intervals in a specific order. Information arrangement that emphasizes the temporal context between nodes (eg chronology)
It is also possible to easily construct a system for the purpose.

[Brief description of the drawings]

FIG. 1 is an overall conceptual diagram of a data structure composed of nodes and links in a general hypertext device;

FIG. 2 is a diagram illustrating an example of link information held in a node;

FIG. 3 is an overall structural diagram of a data structure of a node group in a state where a new node is added to FIG. 3;

FIG. 4 is a diagram illustrating an example of link information held in a node “NODE-A” in a state where link information is newly added;

FIG. 5 is a block diagram showing a configuration of a main part of a hypertext device according to an embodiment of the present invention;

FIG. 6 is a view for explaining members of a node information structure held in a node information management unit;

FIG. 7 is a diagram illustrating slots of a link information structure managed by a link information management unit;

FIG. 8 is a diagram showing an example of a screen display of a user interface in an application program of the hypertext device;

FIG. 9 is a diagram conceptually showing a relationship between nodes and links in a state where the order of link information is changed;

FIG. 10 is a diagram schematically showing a data structure in which hypertext data in a node and link state as shown in FIG. 9 is stored in a node information management unit and a link information management unit;

FIG. 11 is a flowchart illustrating a processing operation when content is displayed according to a link order;

FIG. 12 is a flowchart illustrating a processing operation when a node insertion operation is performed.

[Explanation of symbols]

DESCRIPTION OF SYMBOLS 1 ... Interface control part, 2 ... Input control part, 3 ... Program execution part, 4 ... Display control part, 5 ... Node information management part, 6 ... Link information management part, 7 ... Link operation part, 8 ... Link information entity management Part, 9 node information structure, 10 link information structure, 11, 12, 13, 14 node, 1
5, 16, 17 ... link, 20 ... "START" label, 21, 22, 23 ... link information, 24 ... "END"
Label, 31, 32 node, 33 link, 41 link information, 61 node identifier slot, 62 display procedure slot, 63 entity information pointer slot, 64
... Link information slot, 71 ... Link identifier slot,
72: From link slot; 73: To link slot.

Continuation of front page (56) References JP-A-5-225185 (JP, A) JP-A-5-242166 (JP, A) JP-A-5-73397 (JP, A) JP-A-5-80967 (JP) JP-A-5-108288 (JP, A) JP-A-5-225037 (JP, A) JP-A-2-270068 (JP, A) JP-A-5-73245 (JP, A) 5-108457 (JP, A) JP-A-2-285470 (JP, A) JP-A-1-177633 (JP, A) JP-A-4-321144 (JP, A) JP-A-5-108458 (JP, A) A) JP-A-63-286942 (JP, A) JP-A-5-225035 (JP, A) JP-A-5-108456 (JP, A) 1) ", Fujitsu Limited, October 1990, p. 9-10, 72-77 Nakamura et al., "MediaPreview w: Example of building a program standard / scenario creation support system using multimedia information", Information Processing Society of Japan Research Report, (1992), Vol. 92, No. 89 (HI-45 IM-8), p. 29-36 Tokumura et al., “Special Issue on System Product Technology, Multimedia Systems and Application Examples”, Fuji Xerox Technical Report, Fuji Xerox, (1992), 7, p. 115-134 Shimizu et al., "Multimedia Document Generation Support System with MediaPreview + Database Interface", IPSJ Symposium, (1993), Vol. 7, p. 9-16 Yabu et al., "Multimedia Information Compilation System", Proc. Of the IPSJ National Convention, (1991), Vol. 43, No. 3, p. 3.343-3.346 (58) Fields investigated (Int. Cl. ⁶ , DB name) G06F 12/00 547 G06F 15/20-15/419

Claims (4)

(57) [Claims] 1. A hypertext device that manages hypertext composed of nodes that hold information and link information that holds relationships between the nodes, and displays information stored in each node according to the link information. Node information storage means for managing nodes and storing information held in the nodes; and link information holding relationships between the nodes in accordance with the order.
Link information management means for storing and managing the stored link order, and link information stored in the link information management means .
By changing the order of storage, and the link ranking operation means for operating the sequence of its, to the link link information information stored in the management unit
More hypertext apparatus characterized by comprising a display control means for sequentially displaying the information stored in the node in accordance with sequence of it. 2. The hypertext apparatus according to claim 1, wherein the link sequence operation unit is configured to execute a previous operation in response to a user operation.
A hypertext device wherein reference, addition, deletion, and replacement operations are performed on each element stored in the link information management means . 3. The hypertext apparatus according to claim 1, further comprising: a link information browse for displaying a list of all or specified link information managed by said link information management means on a display screen. A hypertext device comprising means. 4. The hypertext device according to claim 3, further comprising a user interface unit for directly operating the order of the link information listed on the display screen by the link information browsing unit. And a hypertext device.