Show simple item record

dc.contributor.advisorVanDoren, James R.
dc.contributor.authorHernon, Mary Beth
dc.date.accessioned2015-09-16T18:21:31Z
dc.date.available2015-09-16T18:21:31Z
dc.date.issued1979-07-01
dc.identifier.urihttps://hdl.handle.net/11244/18135
dc.description.abstractThis study is concerned with the development and extension of a class of height balanceti binary search trees known as HB(k} trees. HE(k} trees are an important alternative data structure in file systems wtere rapid access and rapiri update are desired. However, a precise analysis of expected system performance using HB(k) trees is impossible since a precise analysis of the expected behavior of HB{k) trees remains unfornmlated. A generalized class of HB(k) trees, known as PHB(kl,k2) trees, may pravide tte tool necessary to analyze the expected behavior of HE(k) trees. The design of algorithms for maintaining these trees and the subsequent implementation of the algorithms as part of a research tool for height balanced trees are also discussed. Results from an initial use of the research tool are presented.
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.titleDesign and Application of a Research Tool for Height Balanced Trees
dc.typetext
dc.contributor.committeeMemberChandler, J. P.
dc.contributor.committeeMemberGrace, Donald
osu.filenameThesis-1979-H558d.pdf
osu.accesstypeOpen Access
dc.description.departmentComputing and Information Sciences
dc.type.genreThesis


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record