{"id":{"repo_id":"vt","oai_identifier":"oai:vtechworks.lib.vt.edu:10919/46440"},"canonical_url":"https://search.dev.ndltd.org/etd/vt/oai:vtechworks.lib.vt.edu:10919/46440","repository":{"repo_id":"vt","name":"Virginia Tech","base_url":"https://vtechworks.lib.vt.edu/oai/request"},"display":{"title":"Heuristics for laying out information graphs","abstract":"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.","abstract_html":"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.","abstract_has_math":false,"creators":["Lavinus, Joseph W."],"institution":"Virginia Tech","degree_name":"Master of Science","degree_level":"masters","degree_discipline":"Computer Science and Applications","degree_department":"Computer Science and Applications","school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":1992,"date_issued":"1992-08-05","date_published":"1992-08-05","updated_at":"2026-07-22T22:19:27Z","subjects":[],"languages":["en"],"rights":["In Copyright"],"rights_urls":["http://rightsstatements.org/vocab/InC/1.0/"],"identifier_entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["etd-12302008-063333"],"render_values":[{"text":"etd-12302008-063333","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/10919/46440","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.department","label":"Department","values":["Computer Science and Applications"]},{"key":"dc:creator","label":"Author","values":["Lavinus, Joseph W."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-03-14T21:52:41Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-03-14T21:52:41Z","2008-12-30"]},{"key":"dc:date.issued","label":"Date","values":["1992-08-05"]},{"key":"dc:publisher","label":"Institution","values":["Virginia Tech"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"dc:type.dcmitype","label":"Dc Type Dcmitype","values":["Text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science and Applications"]},{"key":"thesis:degree_level","label":"Degree Level","values":["masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Virginia Polytechnic Institute and State University"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["In Copyright"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://rightsstatements.org/vocab/InC/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["etd-12302008-063333"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10919/46440"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Master of Science"]},{"key":"dc:format.medium","label":"Dc Format Medium","values":["BTD"]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Heuristics for laying out information graphs"]}]}],"canonical_facts":{"dc:contributor.department":["Computer Science and Applications"],"dc:creator":["Lavinus, Joseph W."],"dc:date.accessioned":["2014-03-14T21:52:41Z"],"dc:date.available":["2014-03-14T21:52:41Z","2008-12-30"],"dc:date.issued":["1992-08-05"],"dc:description.abstract":["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."],"dc:description.degree":["Master of Science"],"dc:format.medium":["BTD"],"dc:format.mimetype":["application/pdf"],"dc:identifier.other":["etd-12302008-063333"],"dc:identifier.uri":["http://hdl.handle.net/10919/46440"],"dc:language.iso":["en"],"dc:publisher":["Virginia Tech"],"dc:rights":["In Copyright"],"dc:rights.uri":["http://rightsstatements.org/vocab/InC/1.0/"],"dc:title":["Heuristics for laying out information graphs"],"dc:type":["Thesis"],"dc:type.dcmitype":["Text"],"thesis:degree_discipline":["Computer Science and Applications"],"thesis:degree_level":["masters"],"thesis:degree_name":["Master of Science"],"thesis:institution_name":["Virginia Polytechnic Institute and State University"]},"updated_at":"2026-07-22T22:19:27Z"}