Heuristics for laying out information graphs

• Main Author: Lavinus, Joseph W.
• Other Authors: Computer Science and Applications
• Format: Others
• Language: en
• Published: Virginia Tech 2014
• Subjects: LD5655.V855 1992.L385; Database management; Graph theory; Heuristic programming
• Online Access: http://hdl.handle.net/10919/46440; http://scholar.lib.vt.edu/theses/available/etd-12302008-063333/

<p>The representation of information in modern database systems is complicated by the need to represent relationships among pieces of information. A natural representation for such databases is the information graph that associates the pieces of information with vertices in the graph and the relationships with edges. Five characteristics of this representation are noteworthy. First, each vertex has a size (in bytes) sufficient to store its corresponding piece of information. Second, retrieval in an information graph may follow a number of patterns; in particular, retrieval of adjacent vertices via edge traversals must be efficient. Third, in many applications such as a dictionary or bibliographic archive, the information graph may be considered static. Fourth, the ultimate home for an information graph is likely to be a roughly linear medium such as a magnetic disk or CD-ROM. Finally, information graphs are quite large-hundreds of thousands of vertices and tens of megabytes in size.</p> === Master of Science