Dismiss
InnovationQ will be updated on Sunday, Oct. 22, from 10am ET - noon. You may experience brief service interruptions during that time.
Browse Prior Art Database

Method of Transforming Data Structure from a Tree into a Hyper Link Structure

IP.com Disclosure Number: IPCOM000109814D
Original Publication Date: 1992-Sep-01
Included in the Prior Art Database: 2005-Mar-24
Document File: 2 page(s) / 57K

Publishing Venue

IBM

Related People

Hirayama, Y: AUTHOR

Abstract

Disclosed is a method for transforming a hierarchical data structure into a hyper-link data structure. The data contained in a tree structure, such as information on technical papers, can be easily searched through the hierarchical relationship (Fig. 1), but it is difficult to move between two data that are not hierarchically linked. If the data structure is transformed from a tree into a hyper-link structure, however, it is easy to move between any data.

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

Method of Transforming Data Structure from a Tree into a Hyper Link Structure

       Disclosed is a method for transforming a hierarchical
data structure into a hyper-link data structure.  The data contained
in a tree structure, such as information on technical papers, can be
easily searched through the hierarchical relationship (Fig. 1), but
it is difficult to move between two data that are not hierarchically
linked.  If the data structure is transformed from a tree into a
hyper-link structure, however, it is easy to move between any data.

      To transform the data structure from a tree into a hyper-link
structure, the following method is used (Fig. 2).

      The data in each level of a tree are transformed into a list
structure. Nodes of the list are called "real nodes".  When a link
from one real node to another is made, a node called "link node" is
used.  When multiple links are made from a real node, the link nodes
form a list, and a link is made from each link node to the target
real node.  When it is necessary to make bidirectional links between
two real nodes, each real node makes a link node, adds it to a link
node list, and makes a link from the link node to another real node.

      If a list of real nodes is made, it is easy to add and
delete real nodes.  The consistency of real nodes in each list is
kept by checking for duplication of data in the list.  Link nodes can
also be added and deleted easily.  Through the use of link nodes,...