Heuristics for laying out information graphs

Simple item page
dc.contributor.authorLavinus, Joseph W.en
dc.contributor.departmentComputer Science and Applicationsen
dc.date.accessioned2014-03-14T21:52:41Zen
dc.date.adate2008-12-30en
dc.date.available2014-03-14T21:52:41Zen
dc.date.issued1992-08-05en
dc.date.rdate2008-12-30en
dc.date.sdate2008-12-30en
dc.description.abstractThe 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.en
dc.description.degreeMaster of Scienceen
dc.format.extentix, 98 leavesen
dc.format.mediumBTDen
dc.format.mimetypeapplication/pdfen
dc.identifier.otheretd-12302008-063333en
dc.identifier.sourceurlhttp://scholar.lib.vt.edu/theses/available/etd-12302008-063333/en
dc.identifier.urihttp://hdl.handle.net/10919/46440en
dc.language.isoenen
dc.publisherVirginia Techen
dc.relation.haspartLD5655.V855_1992.L385.pdfen
dc.relation.isformatofOCLC# 26820125en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subject.lccLD5655.V855 1992.L385en
dc.subject.lcshDatabase managementen
dc.subject.lcshGraph theoryen
dc.subject.lcshHeuristic programmingen
dc.titleHeuristics for laying out information graphsen
dc.typeThesisen
dc.type.dcmitypeTexten
thesis.degree.disciplineComputer Science and Applicationsen
thesis.degree.grantorVirginia Polytechnic Institute and State Universityen
thesis.degree.levelmastersen
thesis.degree.nameMaster of Scienceen

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
LD5655.V855_1992.L385.pdf
Size:
3.31 MB
Format:
Adobe Portable Document Format
Download

Collections

Masters Theses