Abstract

This paper describes an algorithm called the Deduction Tracing Algorithm (DTA) which utilizes basic properties of functional dependencies from database systems and a modification of a tree search algorithm from artificial intelligence. The algorithm takes a set of functional dependencies, F, along with a specific functional dependency L → R as input and produces a list of functional dependencies from F that can be used to deduce L → R. The resulting algorithm is easily automated to provide relational database users with a tool for organizing their queries.

Department(s)

Computer Science

Comments

This report is substantially the M.S. thesis of the first author, completed March, 1988.

Report Number

CSc-88-2

Document Type

Technical Report

Document Version

Final Version

File Type

text

Language(s)

English

Rights

© 1988 University of Missouri--Rolla, All rights reserved.

Publication Date

01 Mar 1988

Share

 
COinS