Normal forms and syntactic completeness proofs for functional independencies

Duminda Wijesekera, M. Ganesh, Jaideep Srivastava, Anil Nerode

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish (US)
Pages (from-to)365-405
Number of pages41
JournalTheoretical Computer Science
Volume266
Issue number1-2
DOIs
StatePublished - Sep 6 2001

Bibliographical note

Funding Information:
This work was partially supported by DoD MURI grant DAAH04-96-10341. ∗Corresponding author. E-mail addresses: duminda@isse.gmu.edu (D. Wijesekera), ganesh@genelogic.com srivasta@cs.umn.edu (J. Srivastava), anil@math.cornell.edu (A. Nerode).

Keywords

  • Completeness proofs
  • Data mining
  • Functional dependencies
  • Integrity constraints

Fingerprint Dive into the research topics of 'Normal forms and syntactic completeness proofs for functional independencies'. Together they form a unique fingerprint.

Cite this