Date of Award

4-1986

Degree Name

Master of Science

Department

Computer Science

First Advisor

Dr. Robert Trenary

Second Advisor

Dr. Dalia Motzkin

Access Setting

Masters Thesis-Open Access

Abstract

Currently proposed methods for retrieval of records from a generalized file organization are not optimal, causing more I\0 retrievals than are necessary. This paper proposes another technique that has near optimal results and has a polynomial order of complexity.

The technique takes as input a query in disjunctive form, sorts the keys in the query in ascending order according to the number of records associated with them, then using a table much like a prime implicant table, systematically searches for a complete cover of the query conjuncts with a minimum total number of records associated with the keys that are chosen for the cover.

This technique along with two current query optimization techniques were implemented and an a posterior analysis of the algorithm was made for reliability in finding the optimal solution to randomly generated queries.

Share

COinS