Title page for ETD etd-12302008-063333
|Type of Document
||Lavinus, Joseph W.
||Heuristics for laying out information graphs
||Master of Science
||Computer Science and Applications
|No Advisors Found
|Date of Defense
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
|| Approximate Download Time
| 28.8 Modem
|| 56K Modem
|| ISDN (64 Kb)
|| ISDN (128 Kb)
|| Higher-speed Access
next to an author's name indicates that all
files or directories associated with their ETD
are accessible from the Virginia Tech campus network only.
If you have questions or technical
problems, please Contact DLA.