Author

Ishaque

Date of Award

8-1989

Degree Name

Master of Science

Department

Computer Science

First Advisor

Dr. Dalia Motzkin

Second Advisor

Dr. Kenneth Williams

Third Advisor

Dr. Alfred Boals

Access Setting

Masters Thesis-Open Access

Abstract

This work presents efficient methodology for the design of relational databases and an implementation of a design tool. A set of algorithms and supporting theory are discussed. Improvements are made on existing decomposition approaches.

The Dependency Preserving Normal Fom (DPNF), which is stronger than 3NF, is presented. It guarantees a decomposition with lossless join property and at the same time preserves all of the functional dependencies.

An algorithm to obtain DPNF decomposition is presented. The algorithm computes DPNF decomposition in polynomial time. It converts supplied functional dependencies to annular cover and uses reduced annular cover to compute closures and decomposition. The algorithm finds the keys for every decomposed scheme and the original scheme. The document contains a PASCAL implementation of the algorithm.

Share

COinS