Show simple item record

dc.contributor.advisorFolk, Michael
dc.contributor.authorJagoe, John Patrick
dc.date.accessioned2015-08-21T20:36:38Z
dc.date.available2015-08-21T20:36:38Z
dc.date.issued1984-05-01
dc.identifier.urihttps://hdl.handle.net/11244/16026
dc.description.abstractThis study examines the effect of receding common prefixes of shortest separators and thus extending the alphabet and compressing both the sequence set and the simple prefix B-tree index. The purpose of the study is to investigate the effect on a simple prefix B-tree of receding prefixes with a shorter symbol that maintains collating sequence order.
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.titlePrefix Recoding: a Front-end Compression Technique for Simple Prefix B-trees
dc.typetext
dc.contributor.committeeMemberChandler, John
dc.contributor.committeeMemberGrace, Donald
osu.filenameThesis-1984-J24p.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