Browse Prior Art Database

Efficient Derive Engine for Building an Indented Class Relationship Report

IP.com Disclosure Number: IPCOM000106015D
Original Publication Date: 1993-Sep-01
Included in the Prior Art Database: 2005-Mar-20
Document File: 2 page(s) / 55K

Publishing Venue

IBM

Related People

Li, SG: AUTHOR

Abstract

A design of an efficient Derive Engine for building an indented class relationship report is disclosed. When identifying class relationships for a huge object-oriented software system, a Derive Engine will have to search through a giant database that contains the immediate class relationships to generate the report in an indented format. The immediate class relationships are the l-level relationships that directly link to classes. The database containing these immediate relationships can be viewed as a web. There are thousands of tree structures hidden in the web. For a given class, the Derive Engine will have to search the database to find the tree structure for the class's dependency(or dependents) relationship. In a way, this search can be considered as a tree traversing operation.

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

Efficient Derive Engine for Building an Indented Class Relationship Report

      A design of an efficient Derive Engine for building an indented
class relationship report is disclosed.  When identifying class
relationships for a huge object-oriented software system, a Derive
Engine will have to search through a giant database that contains the
immediate class relationships to generate the report in an indented
format.  The immediate class relationships are the l-level
relationships that directly link to classes.  The database containing
these immediate relationships can be viewed as a web.  There are
thousands of tree structures hidden in the web.  For a given class,
the Derive Engine will have to search the database to find the tree
structure for the class's dependency(or dependents) relationship.  In
a way, this search can be considered as a tree traversing operation.
Although there have been many algorithms developed for tree
traversing, most of them are designed for searching a spacific object
in a tree.  In addition, most algorithms cannot satisfy both
efficiency and memory storage requirements when working on a huge
tree.  There are three major challanges in the taks of generating
such report.  First, the Derive Engine has to intelligently identify
the tree structure that is embedded in the database.  Second, the
Derive Engine will need to build the tree structure while searching
through the database.  Third, the Derive engine will have to store
the tree structur...