| dc.contributor.advisor | Doren, James R. Van | |
| dc.contributor.author | Feng, An-Lee Anne | |
| dc.date.accessioned | 2015-08-27T16:25:35Z | |
| dc.date.available | 2015-08-27T16:25:35Z | |
| dc.date.issued | 1982-12-01 | |
| dc.identifier.uri | https://hdl.handle.net/11244/16527 | |
| dc.description.abstract | This thesis deals with two competing index mechanisms, namely, prefix B+-trees and trie structures, which are useful for handling varying size keys in document retrieval systems. Refinements and variants of these two indexing methods are studied. Tradeoffs of storage requirements and retrieval time or performance benefits and maintainance difficulties for various refining approaches are examined. | |
| dc.format | application/pdf | |
| dc.language | en_US | |
| dc.publisher | Oklahoma State University | |
| dc.rights | Copyright 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.title | Study of Two Competing Index Mechanisms: Prefix B+-tree and Trie Structures | |
| dc.type | text | |
| dc.contributor.committeeMember | Fisher, Donald D. | |
| dc.contributor.committeeMember | Thoreson, Sharilyn A. | |
| osu.filename | Thesis-1982-F332s.pdf | |
| osu.accesstype | Open Access | |
| dc.description.department | Computing and Information Science | |
| dc.type.genre | Thesis | |
