Normal forms and syntactic completeness proofs for functional independencies

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

doi:10.1016/S0304-3975(00)00195-X

Normal forms and syntactic completeness proofs for functional independencies

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

Computer Science and Engineering

Research output: Contribution to journal › Article › peer-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 language	English (US)
Pages (from-to)	365-405
Number of pages	41
Journal	Theoretical Computer Science
Volume	266
Issue number	1-2
DOIs	https://doi.org/10.1016/S0304-3975(00)00195-X
State	Published - Sep 6 2001

Bibliographical note

Funding Information:
This work was partially supported by DoD MURI grant DAAH04-96-10341. ∗Corresponding author. E-mail addresses: [email protected] (D. Wijesekera), [email protected] [email protected] (J. Srivastava), [email protected] (A. Nerode).

Keywords

Completeness proofs
Data mining
Functional dependencies
Integrity constraints

Publisher link

10.1016/S0304-3975(00)00195-X

Find It

Find It at U of M Libraries

Cite this

@article{b6ce719acfb04245a89b9ed9e06da22b,

title = "Normal forms and syntactic completeness proofs for functional independencies",

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.",

keywords = "Completeness proofs, Data mining, Functional dependencies, Integrity constraints",

author = "Duminda Wijesekera and M. Ganesh and Jaideep Srivastava and Anil Nerode",

note = "Funding Information: This work was partially supported by DoD MURI grant DAAH04-96-10341. ∗Corresponding author. E-mail addresses: [email protected] (D. Wijesekera), [email protected] [email protected] (J. Srivastava), [email protected] (A. Nerode).",

year = "2001",

month = sep,

day = "6",

doi = "10.1016/S0304-3975(00)00195-X",

language = "English (US)",

volume = "266",

pages = "365--405",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

number = "1-2",

}

TY - JOUR

T1 - Normal forms and syntactic completeness proofs for functional independencies

AU - Wijesekera, Duminda

AU - Ganesh, M.

AU - Srivastava, Jaideep

AU - Nerode, Anil

N1 - Funding Information: This work was partially supported by DoD MURI grant DAAH04-96-10341. ∗Corresponding author. E-mail addresses: [email protected] (D. Wijesekera), [email protected] [email protected] (J. Srivastava), [email protected] (A. Nerode).

PY - 2001/9/6

Y1 - 2001/9/6

N2 - 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.

AB - 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.

KW - Completeness proofs

KW - Data mining

KW - Functional dependencies

KW - Integrity constraints

UR - http://www.scopus.com/inward/record.url?scp=0035817802&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035817802&partnerID=8YFLogxK

U2 - 10.1016/S0304-3975(00)00195-X

DO - 10.1016/S0304-3975(00)00195-X

M3 - Article

AN - SCOPUS:0035817802

SN - 0304-3975

VL - 266

SP - 365

EP - 405

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 1-2

ER -

Normal forms and syntactic completeness proofs for functional independencies

Abstract

Bibliographical note

Keywords

Publisher link

Find It

Other files and links

Fingerprint

Cite this