Computer Science Technical Reports
CS at VT

Heuristics for Laying Out Information Graphs

Heath, Lenwood S. and Lavinus, Joseph W. (1993) Heuristics for Laying Out Information Graphs. Technical Report TR-93-27, Computer Science, Virginia Polytechnic Institute and State University.

Full text available as:
PDF - Requires Adobe Acrobat Reader or other PDF viewer.
TR-93-27.pdf (1120314)


The concept of an information graph is introduced as a representation for object-oriented databases. The retrieval layout problem is an optimization problem defined over the class of information graphs. The layout abstracts the space efficiency of representing the database as well as the time efficiency of information retrieval. Heuristics for the retrieval layout problem are identified and evaluated experimentally. A new heuristic, connectivity traversal, is found to be fast and to produce high quality layouts.

Item Type:Departmental Technical Report
Subjects:Computer Science > Historical Collection(Till Dec 2001)
ID Code:369
Deposited By:User autouser
Deposited On:05 December 2001