A comparative study of height-balanced tree

Simple item page
dc.contributor.advisorHuang, Stephen S. H.
dc.contributor.committeeMemberSimpson, Anne L.
dc.contributor.committeeMemberWu, Tiee-Jian
dc.creatorWang, Ronghuey Alice
dc.date.accessioned2024-04-22T20:17:39Z
dc.date.available2024-04-22T20:17:39Z
dc.date.issued1987
dc.description.abstractHeight-balanced trees (H-trees), a recently proposed data structure, is a variant of B-trees. An H([beta], [gamma], [delta]) tree is defined by three parameters: [beta], the size of a node; [gamma], the minimal number of grandsons which a node must have; and [delta], the minimal number of leaves which bottom nodes must have. The purpose of this research is to study H-trees empirically. Algorithms, to insert and delete elements, are implemented. The results of our experiments confirm the validity of existing theories. For example, by varying the parameters [delta] and [gamma], significant changes in the tree's performance are observed: the height of H-trees decreases as [gamma] increases, and the storage utilization increases as [delta] increases. Moreover, comparisons of H-trees with other variants of B-trees are shown to demonstrate the superiority of H-trees. Specifically, the average storage utilization of H-trees may be higher than that of B-trees by almost 20%.
dc.description.departmentComputer Science, Department of
dc.format.digitalOriginreformatted digital
dc.format.mimetypeapplication/pdf
dc.identifier.other18450434
dc.identifier.urihttps://hdl.handle.net/10657/17032
dc.language.isoen
dc.rightsThis item is protected by copyright but is made available here under a claim of fair use (17 U.S.C. Section 107) for non-profit research and educational purposes. Users of this work assume the responsibility for determining copyright status prior to reusing, publishing, or reproducing this item for purposes other than what is allowed by fair use or other copyright exemptions. Any reuse of this item in excess of fair use or other copyright exemptions requires express permission of the copyright holder.
dc.subjectTrees (Graph theory)--Data processing
dc.subjectData structures (Computer science)
dc.titleA comparative study of height-balanced tree
dc.type.dcmiText
dc.type.genreThesis
thesis.degree.collegeCollege of Natural Sciences and Mathematics
thesis.degree.departmentComputer Science, Department of
thesis.degree.disciplineComputer Science
thesis.degree.grantorUniversity of Houston
thesis.degree.levelMasters
thesis.degree.nameMaster of Science

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Wang_1987_18450434.pdf
Size:
2.36 MB
Format:
Adobe Portable Document Format
Download

Collections

Legacy Theses and Dissertations (1940-2009)