Experimental Implementation for Prefix B-tree and Associated Dynamic Lists
Abstract
This thesis deals with an experimental implementation of a combined B-tree indexing scheme and a buddy system for organizing and managing key words and inverted lists respectively. Measurements are developed to compare the performance of buddy system variations in terms of execution time and storage utilization.
Collections
- OSU Theses [15752]