Heuristics for Laying Out Information Graphs

Simple item page
dc.contributor.authorHeath, Lenwood S.en
dc.contributor.authorLavinus, Joseph W.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:36:11Zen
dc.date.available2013-06-19T14:36:11Zen
dc.date.issued1993en
dc.description.abstractThe 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.en
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000369/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000369/01/TR-93-27.pdfen
dc.identifier.trnumberTR-93-27en
dc.identifier.urihttp://hdl.handle.net/10919/19797en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titleHeuristics for Laying Out Information Graphsen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR-93-27.pdf
Size:
1.07 MB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science Technical Reports