Show simple item record

dc.contributor.advisorVan Doren, James R.
dc.contributor.authorWung, Hwey-Hwa
dc.date.accessioned2015-08-27T16:06:16Z
dc.date.available2015-08-27T16:06:16Z
dc.date.issued1983-07-01
dc.identifier.urihttps://hdl.handle.net/11244/16464
dc.description.abstractThis thesis deals with an experimental implementation of a combined B-tree indexing scheme and a buddy system for organizing and managing key words and inverted lists respectively. Measurements are developed to compare the performance of buddy system variations in terms of execution time and storage utilization.
dc.formatapplication/pdf
dc.languageen_US
dc.publisherOklahoma State University
dc.rightsCopyright is held by the author who has granted the Oklahoma State University Library the non-exclusive right to share this material in its institutional repository. Contact Digital Library Services at lib-dls@okstate.edu or 405-744-9161 for the permission policy on the use, reproduction or distribution of this material.
dc.titleExperimental Implementation for Prefix B-tree and Associated Dynamic Lists
dc.typetext
dc.contributor.committeeMemberChandler, John P.
dc.contributor.committeeMemberFolk, Michael J.
osu.filenameThesis-1983-W965e.pdf
osu.accesstypeOpen Access
dc.description.departmentComputing and Information Science
dc.type.genreThesis


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record