Study of Two Competing Index Mechanisms: Prefix B+-tree and Trie Structures
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.
Collections
- OSU Theses [15752]