VTechWorks staff will be away for the Thanksgiving holiday beginning at noon on Wednesday, November 27, through Friday, November 29. We will resume normal operations on Monday, December 2. Thank you for your patience.
 

An object-oriented database system for efficient information retrieval applications

Simple item page
dc.contributor.authorChen, QiFanen
dc.contributor.committeechairFox, Edward A.en
dc.contributor.committeechairNutter, Jane Terryen
dc.contributor.committeememberHeath, Lenwood S.en
dc.contributor.committeememberLee, John A. N.en
dc.contributor.committeememberBoisen, Monte B. Jr.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2014-03-14T20:12:49Zen
dc.date.adate2008-06-06en
dc.date.available2014-03-14T20:12:49Zen
dc.date.issued1992-03-16en
dc.date.rdate2008-06-06en
dc.date.sdate2008-06-06en
dc.description.abstractThis dissertation deals with the application of object-oriented database techniques to the problem of storage and access of information retrieval (IR) data, especially data that can be organized as a graph, such as a thesaurus encoded in semantic networks, or hypertext collections. Even traditional IR models can use graph representations of documents and concepts. This dissertation reports the development of an object-oriented model called the LEND (Large External object-oriented Network Database) model. This model contains not only features found in a typical object-oriented model but also those that specifically are designed for graph-structured data. A query language is provided facilitating the specification of graph-oriented queries. A prototype LEND system has been implemented to test the model on realistic graph-structured data. It adopts an open system architecture and design, and is easily extensible, like the LEND model itself. The research result of suitable data structures and algorithms (a class of minimal perfect hashing functions) for the efficient implementation of the LEND model is also reported. These data structures and algorithms enable retrieval of a node or a set of nodes in an optimal fashion. Placement of a large graph on a disk is studied as well. The method developed permits efficient traversal of graphs.en
dc.description.degreePh. D.en
dc.format.extentxiii, 240 leavesen
dc.format.mediumBTDen
dc.format.mimetypeapplication/pdfen
dc.identifier.otheretd-06062008-170433en
dc.identifier.sourceurlhttp://scholar.lib.vt.edu/theses/available/etd-06062008-170433/en
dc.identifier.urihttp://hdl.handle.net/10919/27976en
dc.language.isoenen
dc.publisherVirginia Techen
dc.relation.haspartLD5655.V856_1992.C535.pdfen
dc.relation.isformatofOCLC# 26354504en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subject.lccLD5655.V856 1992.C535en
dc.subject.lcshInformation storage and retrieval systemsen
dc.titleAn object-oriented database system for efficient information retrieval applicationsen
dc.typeDissertationen
dc.type.dcmitypeTexten
thesis.degree.disciplineComputer Scienceen
thesis.degree.grantorVirginia Polytechnic Institute and State Universityen
thesis.degree.leveldoctoralen
thesis.degree.namePh. D.en

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
LD5655.V856_1992.C535.pdf
Size:
12.34 MB
Format:
Adobe Portable Document Format
Description:
Download

Collections

Doctoral Dissertations