Local Search for the Retrieval Layout Problem

Simple item page
dc.contributor.authorHeath, Lenwood S.en
dc.contributor.authorLavinus, Joseph W.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:37:03Zen
dc.date.available2013-06-19T14:37:03Zen
dc.date.issued1993-08-01en
dc.description.abstractAn information graph is a data representation for object-oriented databases in which each object is a vertex and each relationship between objects is an edge. The retrieval layout problem is to arrange the storage of an information graph on a physical medium so as to use storage efficiently and to allow rapid navigation along paths in the graph. This paper describes an empirical study of the performance of various local search heuristics for the retrieval layout problem, including local optimization, simulated annealing, tabu search, and genetic algorithms. In addition, the hierarchical hybrid approach is introduced.en
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000370/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000370/01/TR-93-28.pdfen
dc.identifier.trnumberTR-93-28en
dc.identifier.urihttp://hdl.handle.net/10919/19853en
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.titleLocal Search for the Retrieval Layout Problemen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR-93-28.pdf
Size:
890.36 KB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science Technical Reports