Accession Number:

ADA364422

Title:

Normal Forms and Syntactic Completeness Proofs for Functional Independencies

Descriptive Note:

Technical rept.

Corporate Author:

CALIFORNIA UNIV BERKELEY SPONSORED PROJECTS OFFICE

Report Date:

1998-11-01

Pagination or Media Count:

45.0

Abstract:

We prove normal form theorems of a complete axiom system for the inference of functional dependencies and independencies in relational databases. We also show that all proofs in our system have a normal form where the application of independency rules is limited to three levels. Our normal form results in a faster proof search engine in deriving consequences of functional independencies. As a result, we get a new construction of an Armstrong relation for a given set of functional dependencies. It is also shown that an Armstrong relation for a set of functional dependencies and independencies do not exist in general, and this generalizes the same result valid under the closed world assumption.

Subject Categories:

  • Computer Systems

Distribution Statement:

APPROVED FOR PUBLIC RELEASE